Base | Representation |
---|---|
bin | 10010101110110001… |
… | …10011100100001011 |
3 | 221221211020112012101 |
4 | 21113120303210023 |
5 | 131043322230201 |
6 | 4341504054231 |
7 | 504125025520 |
oct | 112730634413 |
9 | 27854215171 |
10 | 10056055051 |
11 | 42a0420aa9 |
12 | 1b47904377 |
13 | c434b5943 |
14 | 6b5795147 |
15 | 3dcc81d01 |
hex | 25763390b |
10056055051 has 16 divisors (see below), whose sum is σ = 11929579200. Its totient is φ = 8293799808.
The previous prime is 10056055039. The next prime is 10056055057. The reversal of 10056055051 is 15055065001.
10056055051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10056055051 - 25 = 10056055019 is a prime.
It is a super-2 number, since 2×100560550512 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10056055057) 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 15 ways as a sum of consecutive naturals, for example, 25056 + ... + 144013.
It is an arithmetic number, because the mean of its divisors is an integer number (745598700).
Almost surely, 210056055051 is an apocalyptic number.
10056055051 is a deficient number, since it is larger than the sum of its proper divisors (1873524149).
10056055051 is a wasteful number, since it uses less digits than its factorization.
10056055051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169398.
The product of its (nonzero) digits is 3750, while the sum is 28.
The spelling of 10056055051 in words is "ten billion, fifty-six million, fifty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •