Base | Representation |
---|---|
bin | 1001101001111101100011… |
… | …00010110011001111000001 |
3 | 2210011212002102022122121221 |
4 | 10310332301202303033001 |
5 | 10240340142010042423 |
6 | 113054150110515041 |
7 | 4321014404260552 |
oct | 464766142631701 |
9 | 83155072278557 |
10 | 21233002034113 |
11 | 6846958117891 |
12 | 246b121505a81 |
13 | bb0356baab7c |
14 | 53597b7a6329 |
15 | 26c4bbee1e5d |
hex | 134fb18b33c1 |
21233002034113 has 8 divisors (see below), whose sum is σ = 22026207732480. Its totient is φ = 20452907173920.
The previous prime is 21233002034089. The next prime is 21233002034149. The reversal of 21233002034113 is 31143020033212.
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 21233002034113 - 221 = 21232999936961 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21233002031113) 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, 3277706245 + ... + 3277712722.
It is an arithmetic number, because the mean of its divisors is an integer number (2753275966560).
Almost surely, 221233002034113 is an apocalyptic number.
It is an amenable number.
21233002034113 is a deficient number, since it is larger than the sum of its proper divisors (793205698367).
21233002034113 is an equidigital number, since it uses as much as digits as its factorization.
21233002034113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6555419087.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 21233002034113 its reverse (31143020033212), we get a palindrome (52376022067325).
The spelling of 21233002034113 in words is "twenty-one trillion, two hundred thirty-three billion, two million, thirty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •