Base | Representation |
---|---|
bin | 1001101001111101100010… |
… | …11111101010110110001011 |
3 | 2210011212002100202221201022 |
4 | 10310332301133222312023 |
5 | 10240340141302311243 |
6 | 113054150041143055 |
7 | 4321014364301564 |
oct | 464766137526613 |
9 | 83155070687638 |
10 | 21233001213323 |
11 | 6846957707149 |
12 | 246b12118aa8b |
13 | bb03569813b3 |
14 | 53597b63116b |
15 | 26c4bbdcdb68 |
hex | 134fb17ead8b |
21233001213323 has 8 divisors (see below), whose sum is σ = 21595899206400. Its totient is φ = 20870203774248.
The previous prime is 21233001213311. The next prime is 21233001213329. The reversal of 21233001213323 is 32331210033212.
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 21233001213323 - 242 = 16834954702219 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21233001213292 and 21233001213301.
It is not an unprimeable number, because it can be changed into a prime (21233001213329) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24712511 + ... + 25557272.
It is an arithmetic number, because the mean of its divisors is an integer number (2699487400800).
Almost surely, 221233001213323 is an apocalyptic number.
21233001213323 is a deficient number, since it is larger than the sum of its proper divisors (362897993077).
21233001213323 is an equidigital number, since it uses as much as digits as its factorization.
21233001213323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50277001.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 21233001213323 its reverse (32331210033212), we get a palindrome (53564211246535).
The spelling of 21233001213323 in words is "twenty-one trillion, two hundred thirty-three billion, one million, two hundred thirteen thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •