Base | Representation |
---|---|
bin | 1010100111000000101110… |
… | …10111101111010110110001 |
3 | 10001121101111102102021101111 |
4 | 11103200113113233112301 |
5 | 11024222140014413441 |
6 | 121341542114033321 |
7 | 4625404236523063 |
oct | 523402727572661 |
9 | 101541442367344 |
10 | 23330654451121 |
11 | 7485525232936 |
12 | 2749778b78841 |
13 | 10030c07895c4 |
14 | 5a92d15bd733 |
15 | 2a6d3d089081 |
hex | 1538175ef5b1 |
23330654451121 has 4 divisors (see below), whose sum is σ = 23330802138112. Its totient is φ = 23330506764132.
The previous prime is 23330654451077. The next prime is 23330654451197. The reversal of 23330654451121 is 12115445603332.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 23330654451121 - 213 = 23330654442929 is a prime.
It is a super-2 number, since 2×233306544511212 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23330654451821) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 73606281 + ... + 73922566.
It is an arithmetic number, because the mean of its divisors is an integer number (5832700534528).
Almost surely, 223330654451121 is an apocalyptic number.
It is an amenable number.
23330654451121 is a deficient number, since it is larger than the sum of its proper divisors (147686991).
23330654451121 is a wasteful number, since it uses less digits than its factorization.
23330654451121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147686990.
The product of its (nonzero) digits is 259200, while the sum is 40.
The spelling of 23330654451121 in words is "twenty-three trillion, three hundred thirty billion, six hundred fifty-four million, four hundred fifty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •