Base | Representation |
---|---|
bin | 1010100110110010011110… |
… | …10100100111010010000001 |
3 | 10001120122202012021111222121 |
4 | 11103121033110213102001 |
5 | 11024111002311033441 |
6 | 121334234553404241 |
7 | 4625013522245062 |
oct | 523311724472201 |
9 | 101518665244877 |
10 | 23323003221121 |
11 | 748225931a55a |
12 | 27481a2709681 |
13 | 100247158b886 |
14 | 5a8ba7382569 |
15 | 2a6a414d2dd1 |
hex | 15364f527481 |
23323003221121 has 4 divisors (see below), whose sum is σ = 23865398644912. Its totient is φ = 22780607797332.
The previous prime is 23323003221101. The next prime is 23323003221157. The reversal of 23323003221121 is 12112230032332.
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 a de Polignac number, because none of the positive numbers 2k-23323003221121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23323003221101) 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, 271197711831 + ... + 271197711916.
It is an arithmetic number, because the mean of its divisors is an integer number (5966349661228).
Almost surely, 223323003221121 is an apocalyptic number.
It is an amenable number.
23323003221121 is a deficient number, since it is larger than the sum of its proper divisors (542395423791).
23323003221121 is an equidigital number, since it uses as much as digits as its factorization.
23323003221121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 542395423790.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 23323003221121 its reverse (12112230032332), we get a palindrome (35435233253453).
The spelling of 23323003221121 in words is "twenty-three trillion, three hundred twenty-three billion, three million, two hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •