Base | Representation |
---|---|
bin | 1001000111011100010001… |
… | …0100111001100011100101 |
3 | 1022111020021122021102122202 |
4 | 2101313010110321203211 |
5 | 2303211012320431113 |
6 | 33152413245504245 |
7 | 2053112332415243 |
oct | 221670424714345 |
9 | 38436248242582 |
10 | 10023452514533 |
11 | 3214a166a7337 |
12 | 115a741b72085 |
13 | 579290bb4a63 |
14 | 2691cdb71793 |
15 | 125aedd3b258 |
hex | 91dc45398e5 |
10023452514533 has 2 divisors, whose sum is σ = 10023452514534. Its totient is φ = 10023452514532.
The previous prime is 10023452514457. The next prime is 10023452514553. The reversal of 10023452514533 is 33541525432001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9915331895044 + 108120619489 = 3148862^2 + 328817^2 .
It is a cyclic number.
It is not a de Polignac number, because 10023452514533 - 220 = 10023451465957 is a prime.
It is a super-2 number, since 2×100234525145332 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10023452514553) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5011726257266 + 5011726257267.
It is an arithmetic number, because the mean of its divisors is an integer number (5011726257267).
Almost surely, 210023452514533 is an apocalyptic number.
It is an amenable number.
10023452514533 is a deficient number, since it is larger than the sum of its proper divisors (1).
10023452514533 is an equidigital number, since it uses as much as digits as its factorization.
10023452514533 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 38.
Adding to 10023452514533 its reverse (33541525432001), we get a palindrome (43564977946534).
The spelling of 10023452514533 in words is "ten trillion, twenty-three billion, four hundred fifty-two million, five hundred fourteen thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •