Base | Representation |
---|---|
bin | 11010001111111100101001… |
… | …011000110001101011110001 |
3 | 120010202110000221001111212201 |
4 | 122033330221120301223301 |
5 | 110112423101244410001 |
6 | 1045310431153223201 |
7 | 33213430462503226 |
oct | 3217745130615361 |
9 | 503673027044781 |
10 | 115445120310001 |
11 | 3386a000848849 |
12 | 10b46055261b01 |
13 | 4c555747b9c31 |
14 | 20718060b594d |
15 | d52ed4ad3501 |
hex | 68ff29631af1 |
115445120310001 has 2 divisors, whose sum is σ = 115445120310002. Its totient is φ = 115445120310000.
The previous prime is 115445120309999. The next prime is 115445120310019. The reversal of 115445120310001 is 100013021544511.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 115200294259600 + 244826050401 = 10733140^2 + 494799^2 .
It is a cyclic number.
It is not a de Polignac number, because 115445120310001 - 21 = 115445120309999 is a prime.
Together with 115445120309999, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (115445120317001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57722560155000 + 57722560155001.
It is an arithmetic number, because the mean of its divisors is an integer number (57722560155001).
Almost surely, 2115445120310001 is an apocalyptic number.
It is an amenable number.
115445120310001 is a deficient number, since it is larger than the sum of its proper divisors (1).
115445120310001 is an equidigital number, since it uses as much as digits as its factorization.
115445120310001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2400, while the sum is 28.
Adding to 115445120310001 its reverse (100013021544511), we get a palindrome (215458141854512).
The spelling of 115445120310001 in words is "one hundred fifteen trillion, four hundred forty-five billion, one hundred twenty million, three hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •