Base | Representation |
---|---|
bin | 10011101010011001… |
… | …11010100010111000 |
3 | 1000020200110021200220 |
4 | 21311030322202320 |
5 | 133104400120032 |
6 | 4503253100040 |
7 | 522410452605 |
oct | 116514724270 |
9 | 30220407626 |
10 | 10556254392 |
11 | 4527804192 |
12 | 2067327620 |
13 | cc300a698 |
14 | 721d9d6ac |
15 | 41bb3912c |
hex | 27533a8b8 |
10556254392 has 16 divisors (see below), whose sum is σ = 26390636040. Its totient is φ = 3518751456.
The previous prime is 10556254391. The next prime is 10556254399. The reversal of 10556254392 is 29345265501.
It is a happy number.
10556254392 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×105562543922 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10556254391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 219921943 + ... + 219921990.
Almost surely, 210556254392 is an apocalyptic number.
10556254392 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10556254392 is an abundant number, since it is smaller than the sum of its proper divisors (15834381648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10556254392 is a wasteful number, since it uses less digits than its factorization.
10556254392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 439843942 (or 439843938 counting only the distinct ones).
The product of its (nonzero) digits is 324000, while the sum is 42.
The spelling of 10556254392 in words is "ten billion, five hundred fifty-six million, two hundred fifty-four thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •