Base | Representation |
---|---|
bin | 100000001100011… |
… | …011110101010101 |
3 | 1101122100110221201 |
4 | 200030123311111 |
5 | 2101233140040 |
6 | 125332512501 |
7 | 16246014625 |
oct | 4014336525 |
9 | 1348313851 |
10 | 540130645 |
11 | 25798716a |
12 | 130a7b731 |
13 | 87b96242 |
14 | 51a40885 |
15 | 32643a9a |
hex | 2031bd55 |
540130645 has 8 divisors (see below), whose sum is σ = 648365400. Its totient is φ = 431965440.
The previous prime is 540130637. The next prime is 540130649. The reversal of 540130645 is 546031045.
It can be written as a sum of positive squares in 4 ways, for example, as 79524 + 540051121 = 282^2 + 23239^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 540130645 - 23 = 540130637 is a prime.
It is a super-2 number, since 2×5401306452 = 583482227336232050, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (540130649) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1585 + ... + 32905.
It is an arithmetic number, because the mean of its divisors is an integer number (81045675).
Almost surely, 2540130645 is an apocalyptic number.
It is an amenable number.
540130645 is a deficient number, since it is larger than the sum of its proper divisors (108234755).
540130645 is a wasteful number, since it uses less digits than its factorization.
540130645 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34775.
The product of its (nonzero) digits is 7200, while the sum is 28.
The square root of 540130645 is about 23240.7109400724. The cubic root of 540130645 is about 814.3909509960.
It can be divided in two parts, 5401 and 30645, that added together give a triangular number (36046 = T268).
The spelling of 540130645 in words is "five hundred forty million, one hundred thirty thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •