Base | Representation |
---|---|
bin | 1010100001010000100101… |
… | …11010011000110010010101 |
3 | 10000220111100022200101202121 |
4 | 11100220102322120302111 |
5 | 11013002401323331041 |
6 | 121111054132135541 |
7 | 4605206403304141 |
oct | 520502272306225 |
9 | 100814308611677 |
10 | 23133011152021 |
11 | 740972279aa31 |
12 | 27173ba7675b1 |
13 | cba5837a5a04 |
14 | 59d9024ca221 |
15 | 2a1b219867d1 |
hex | 150a12e98c95 |
23133011152021 has 2 divisors, whose sum is σ = 23133011152022. Its totient is φ = 23133011152020.
The previous prime is 23133011151953. The next prime is 23133011152039. The reversal of 23133011152021 is 12025111033132.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22787390620996 + 345620531025 = 4773614^2 + 587895^2 .
It is a cyclic number.
It is not a de Polignac number, because 23133011152021 - 27 = 23133011151893 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23133011152921) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11566505576010 + 11566505576011.
It is an arithmetic number, because the mean of its divisors is an integer number (11566505576011).
Almost surely, 223133011152021 is an apocalyptic number.
It is an amenable number.
23133011152021 is a deficient number, since it is larger than the sum of its proper divisors (1).
23133011152021 is an equidigital number, since it uses as much as digits as its factorization.
23133011152021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 23133011152021 its reverse (12025111033132), we get a palindrome (35158122185153).
The spelling of 23133011152021 in words is "twenty-three trillion, one hundred thirty-three billion, eleven million, one hundred fifty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •