Base | Representation |
---|---|
bin | 110000111001100010… |
… | …1100100101101000001 |
3 | 101001001022221120001101 |
4 | 1201303011210231001 |
5 | 3210030033243001 |
6 | 120124013534401 |
7 | 10405150514524 |
oct | 1416305445501 |
9 | 331038846041 |
10 | 105010056001 |
11 | 40597491354 |
12 | 184277a4401 |
13 | 9b9677c516 |
14 | 51225bcbbb |
15 | 2ae8ecaa01 |
hex | 1873164b41 |
105010056001 has 2 divisors, whose sum is σ = 105010056002. Its totient is φ = 105010056000.
The previous prime is 105010055999. The next prime is 105010056013. The reversal of 105010056001 is 100650010501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 94602995776 + 10407060225 = 307576^2 + 102015^2 .
It is a cyclic number.
It is not a de Polignac number, because 105010056001 - 21 = 105010055999 is a prime.
It is a super-2 number, since 2×1050100560012 (a number of 23 digits) contains 22 as substring.
Together with 105010055999, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 105010056001.
It is not a weakly prime, because it can be changed into another prime (105010054001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52505028000 + 52505028001.
It is an arithmetic number, because the mean of its divisors is an integer number (52505028001).
Almost surely, 2105010056001 is an apocalyptic number.
It is an amenable number.
105010056001 is a deficient number, since it is larger than the sum of its proper divisors (1).
105010056001 is an equidigital number, since it uses as much as digits as its factorization.
105010056001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 150, while the sum is 19.
Adding to 105010056001 its reverse (100650010501), we get a palindrome (205660066502).
The spelling of 105010056001 in words is "one hundred five billion, ten million, fifty-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •