Base | Representation |
---|---|
bin | 110101100100100010… |
… | …1000011000011001001 |
3 | 101222221112010100011101 |
4 | 1223021011003003021 |
5 | 3341101412141241 |
6 | 124503324101401 |
7 | 11211602521153 |
oct | 1531105030311 |
9 | 358845110141 |
10 | 115042693321 |
11 | 44875668256 |
12 | 1a367694861 |
13 | ab051561ca |
14 | 57d4bd9ad3 |
15 | 2ed4b83e31 |
hex | 1ac91430c9 |
115042693321 has 2 divisors, whose sum is σ = 115042693322. Its totient is φ = 115042693320.
The previous prime is 115042693279. The next prime is 115042693379. The reversal of 115042693321 is 123396240511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 114287268096 + 755425225 = 338064^2 + 27485^2 .
It is a cyclic number.
It is not a de Polignac number, because 115042693321 - 217 = 115042562249 is a prime.
It is not a weakly prime, because it can be changed into another prime (115042693121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57521346660 + 57521346661.
It is an arithmetic number, because the mean of its divisors is an integer number (57521346661).
Almost surely, 2115042693321 is an apocalyptic number.
It is an amenable number.
115042693321 is a deficient number, since it is larger than the sum of its proper divisors (1).
115042693321 is an equidigital number, since it uses as much as digits as its factorization.
115042693321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38880, while the sum is 37.
The spelling of 115042693321 in words is "one hundred fifteen billion, forty-two million, six hundred ninety-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.645 sec. • engine limits •