Base | Representation |
---|---|
bin | 111110110111100… |
… | …011111010011101 |
3 | 2201111200222022012 |
4 | 332313203322131 |
5 | 4130004034123 |
6 | 252355001005 |
7 | 35065150631 |
oct | 7667437235 |
9 | 2644628265 |
10 | 1054752413 |
11 | 4a1420110 |
12 | 255299165 |
13 | 13a69a770 |
14 | a0120dc1 |
15 | 628e9378 |
hex | 3ede3e9d |
1054752413 has 16 divisors (see below), whose sum is σ = 1240745856. Its totient is φ = 883967040.
The previous prime is 1054752409. The next prime is 1054752443. The reversal of 1054752413 is 3142574501.
It is not a de Polignac number, because 1054752413 - 22 = 1054752409 is a prime.
It is a super-2 number, since 2×10547524132 = 2225005305458645138, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1054752413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1054752443) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 117656 + ... + 126302.
It is an arithmetic number, because the mean of its divisors is an integer number (77546616).
Almost surely, 21054752413 is an apocalyptic number.
1054752413 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1054752413 is a deficient number, since it is larger than the sum of its proper divisors (185993443).
1054752413 is a wasteful number, since it uses less digits than its factorization.
1054752413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9524.
The product of its (nonzero) digits is 16800, while the sum is 32.
The square root of 1054752413 is about 32476.9520275533. The cubic root of 1054752413 is about 1017.9274888751.
The spelling of 1054752413 in words is "one billion, fifty-four million, seven hundred fifty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •