Base | Representation |
---|---|
bin | 11010010000110001000110… |
… | …111110111111000100100101 |
3 | 120010221211102202000102201102 |
4 | 122100301012332333010211 |
5 | 110114333433032043141 |
6 | 1045352345001005445 |
7 | 33220463432301164 |
oct | 3220610676770445 |
9 | 503854382012642 |
10 | 115501451440421 |
11 | 33890988248892 |
12 | 10b54b56483885 |
13 | 4c5a981102b77 |
14 | 207442b5ad3db |
15 | d546d01bd99b |
hex | 690c46fbf125 |
115501451440421 has 2 divisors, whose sum is σ = 115501451440422. Its totient is φ = 115501451440420.
The previous prime is 115501451440393. The next prime is 115501451440423. The reversal of 115501451440421 is 124044154105511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 76455962088100 + 39045489352321 = 8743910^2 + 6248639^2 .
It is a cyclic number.
It is not a de Polignac number, because 115501451440421 - 242 = 111103404929317 is a prime.
It is a Sophie Germain prime.
Together with 115501451440423, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115501451440423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57750725720210 + 57750725720211.
It is an arithmetic number, because the mean of its divisors is an integer number (57750725720211).
Almost surely, 2115501451440421 is an apocalyptic number.
It is an amenable number.
115501451440421 is a deficient number, since it is larger than the sum of its proper divisors (1).
115501451440421 is an equidigital number, since it uses as much as digits as its factorization.
115501451440421 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64000, while the sum is 38.
The spelling of 115501451440421 in words is "one hundred fifteen trillion, five hundred one billion, four hundred fifty-one million, four hundred forty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •