Base | Representation |
---|---|
bin | 11010010000110100100001… |
… | …101011010110100110100111 |
3 | 120010222011220110000012001122 |
4 | 122100310201223112212213 |
5 | 110114413441322113411 |
6 | 1045354153025444155 |
7 | 33220653363650213 |
oct | 3220644153264647 |
9 | 503864813005048 |
10 | 115505120504231 |
11 | 338924a0348827 |
12 | 10b557bb1a065b |
13 | 4c5b1172b4643 |
14 | 20746989b9943 |
15 | d548473739db |
hex | 690d21ad69a7 |
115505120504231 has 2 divisors, whose sum is σ = 115505120504232. Its totient is φ = 115505120504230.
The previous prime is 115505120504143. The next prime is 115505120504269. The reversal of 115505120504231 is 132405021505511.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 115505120504231 - 234 = 115487940635047 is a prime.
It is a super-2 number, since 2×1155051205042312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 115505120504191 and 115505120504200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115505120404231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57752560252115 + 57752560252116.
It is an arithmetic number, because the mean of its divisors is an integer number (57752560252116).
Almost surely, 2115505120504231 is an apocalyptic number.
115505120504231 is a deficient number, since it is larger than the sum of its proper divisors (1).
115505120504231 is an equidigital number, since it uses as much as digits as its factorization.
115505120504231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30000, while the sum is 35.
The spelling of 115505120504231 in words is "one hundred fifteen trillion, five hundred five billion, one hundred twenty million, five hundred four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •