Base | Representation |
---|---|
bin | 1001000111011100010001… |
… | …0100010010101111011111 |
3 | 1022111020021121222100120112 |
4 | 2101313010110102233133 |
5 | 2303211012300334201 |
6 | 33152413242240235 |
7 | 2053112331153605 |
oct | 221670424225737 |
9 | 38436247870515 |
10 | 10023452355551 |
11 | 3214a165a8948 |
12 | 115a741ab607b |
13 | 579290b5a59b |
14 | 2691cdb2d875 |
15 | 125aedd090bb |
hex | 91dc4512bdf |
10023452355551 has 2 divisors, whose sum is σ = 10023452355552. Its totient is φ = 10023452355550.
The previous prime is 10023452355547. The next prime is 10023452355557. The reversal of 10023452355551 is 15555325432001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10023452355551 - 22 = 10023452355547 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 10023452355499 and 10023452355508.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10023452355557) 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, 5011726177775 + 5011726177776.
It is an arithmetic number, because the mean of its divisors is an integer number (5011726177776).
Almost surely, 210023452355551 is an apocalyptic number.
10023452355551 is a deficient number, since it is larger than the sum of its proper divisors (1).
10023452355551 is an equidigital number, since it uses as much as digits as its factorization.
10023452355551 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 450000, while the sum is 41.
Adding to 10023452355551 its reverse (15555325432001), we get a palindrome (25578777787552).
The spelling of 10023452355551 in words is "ten trillion, twenty-three billion, four hundred fifty-two million, three hundred fifty-five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •