Base | Representation |
---|---|
bin | 10110101111010000000100… |
… | …010111011011111110000001 |
3 | 111010002022001002201010100111 |
4 | 112233100010113123332001 |
5 | 101101431334443212201 |
6 | 552405125011351321 |
7 | 30031025422504066 |
oct | 2657200427337601 |
9 | 433068032633314 |
10 | 100004091772801 |
11 | 29956551782697 |
12 | b271567bb2541 |
13 | 43a5464a8a498 |
14 | 1a9a31c414c6d |
15 | b86508b21b51 |
hex | 5af4045dbf81 |
100004091772801 has 2 divisors, whose sum is σ = 100004091772802. Its totient is φ = 100004091772800.
The previous prime is 100004091772799. The next prime is 100004091772841. The reversal of 100004091772801 is 108277190400001.
It is an a-pointer prime, because the next prime (100004091772841) can be obtained adding 100004091772801 to its sum of digits (40).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99273324960000 + 730766812801 = 9963600^2 + 854849^2 .
It is a cyclic number.
It is not a de Polignac number, because 100004091772801 - 21 = 100004091772799 is a prime.
Together with 100004091772799, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (100004091772841) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50002045886400 + 50002045886401.
It is an arithmetic number, because the mean of its divisors is an integer number (50002045886401).
Almost surely, 2100004091772801 is an apocalyptic number.
It is an amenable number.
100004091772801 is a deficient number, since it is larger than the sum of its proper divisors (1).
100004091772801 is an equidigital number, since it uses as much as digits as its factorization.
100004091772801 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28224, while the sum is 40.
The spelling of 100004091772801 in words is "one hundred trillion, four billion, ninety-one million, seven hundred seventy-two thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •