Base | Representation |
---|---|
bin | 10010101110110001… |
… | …01000110101101011 |
3 | 221221211011021221010 |
4 | 21113120220311223 |
5 | 131043314323430 |
6 | 4341503115003 |
7 | 504124453443 |
oct | 112730506553 |
9 | 27854137833 |
10 | 10056011115 |
11 | 42a03a0a97 |
12 | 1b478a2a63 |
13 | c4349b947 |
14 | 6b5783123 |
15 | 3dcc73cb0 |
hex | 257628d6b |
10056011115 has 8 divisors (see below), whose sum is σ = 16089617808. Its totient is φ = 5363205920.
The previous prime is 10056011113. The next prime is 10056011123. The reversal of 10056011115 is 51111065001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10056011115 - 21 = 10056011113 is a prime.
It is a super-2 number, since 2×100560111152 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10056011091 and 10056011100.
It is not an unprimeable number, because it can be changed into a prime (10056011113) 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, 335200356 + ... + 335200385.
It is an arithmetic number, because the mean of its divisors is an integer number (2011202226).
Almost surely, 210056011115 is an apocalyptic number.
10056011115 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10056011115 is a deficient number, since it is larger than the sum of its proper divisors (6033606693).
10056011115 is an equidigital number, since it uses as much as digits as its factorization.
10056011115 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 670400749.
The product of its (nonzero) digits is 150, while the sum is 21.
Adding to 10056011115 its reverse (51111065001), we get a palindrome (61167076116).
The spelling of 10056011115 in words is "ten billion, fifty-six million, eleven thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •