Base | Representation |
---|---|
bin | 11010001100100011111010… |
… | …110011100000001111111111 |
3 | 120002221012100222121000200111 |
4 | 122030203322303200033333 |
5 | 110100120004100201333 |
6 | 1045011503431410451 |
7 | 33160551636300205 |
oct | 3214437263401777 |
9 | 502835328530614 |
10 | 115212410553343 |
11 | 3378a3441a3304 |
12 | 10b08b2b223a27 |
13 | 4c396398b437c |
14 | 206444bb37075 |
15 | d4be14bc44cd |
hex | 68c8face03ff |
115212410553343 has 2 divisors, whose sum is σ = 115212410553344. Its totient is φ = 115212410553342.
The previous prime is 115212410553329. The next prime is 115212410553463. The reversal of 115212410553343 is 343355014212511.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 115212410553343 - 233 = 115203820618751 is a prime.
It is a super-2 number, since 2×1152124105533432 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 115212410553296 and 115212410553305.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115212410503343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57606205276671 + 57606205276672.
It is an arithmetic number, because the mean of its divisors is an integer number (57606205276672).
Almost surely, 2115212410553343 is an apocalyptic number.
115212410553343 is a deficient number, since it is larger than the sum of its proper divisors (1).
115212410553343 is an equidigital number, since it uses as much as digits as its factorization.
115212410553343 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216000, while the sum is 40.
Adding to 115212410553343 its reverse (343355014212511), we get a palindrome (458567424765854).
The spelling of 115212410553343 in words is "one hundred fifteen trillion, two hundred twelve billion, four hundred ten million, five hundred fifty-three thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •