Base | Representation |
---|---|
bin | 1010100110110000110110… |
… | …11101110010010001100011 |
3 | 10001120120111120012101101022 |
4 | 11103120123131302101203 |
5 | 11024102212100211321 |
6 | 121334012354200055 |
7 | 4624653126261113 |
oct | 523303335622143 |
9 | 101516446171338 |
10 | 23322133210211 |
11 | 7481952210480 |
12 | 2747b9b28302b |
13 | 1002363265214 |
14 | 5a8b239d1043 |
15 | 2a69dee2bdab |
hex | 15361b772463 |
23322133210211 has 8 divisors (see below), whose sum is σ = 25536210267648. Its totient is φ = 21123703341000.
The previous prime is 23322133210151. The next prime is 23322133210283. The reversal of 23322133210211 is 11201233122332.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23322133210211 - 26 = 23322133210147 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23322133216211) 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 in 7 ways as a sum of consecutive naturals, for example, 3911793935 + ... + 3911799896.
It is an arithmetic number, because the mean of its divisors is an integer number (3192026283456).
Almost surely, 223322133210211 is an apocalyptic number.
23322133210211 is a deficient number, since it is larger than the sum of its proper divisors (2214077057437).
23322133210211 is a wasteful number, since it uses less digits than its factorization.
23322133210211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7823594113.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 23322133210211 its reverse (11201233122332), we get a palindrome (34523366332543).
The spelling of 23322133210211 in words is "twenty-three trillion, three hundred twenty-two billion, one hundred thirty-three million, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •