Base | Representation |
---|---|
bin | 1001011001011110010010… |
… | …1000010100100010100101 |
3 | 1100120211212201020222211121 |
4 | 2112113210220110202211 |
5 | 2323244424410401041 |
6 | 33551004333533541 |
7 | 2114360060553034 |
oct | 226274450244245 |
9 | 40524781228747 |
10 | 10333232122021 |
11 | 3324332167476 |
12 | 11aa7966442b1 |
13 | 59c55bb56853 |
14 | 27a1b9a6671b |
15 | 12dbced717d1 |
hex | 965e4a148a5 |
10333232122021 has 12 divisors (see below), whose sum is σ = 10860633587232. Its totient is φ = 9812853103944.
The previous prime is 10333232122019. The next prime is 10333232122027. The reversal of 10333232122021 is 12022123233301.
It is not a de Polignac number, because 10333232122021 - 21 = 10333232122019 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10333232122027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11182111 + ... + 12070876.
It is an arithmetic number, because the mean of its divisors is an integer number (905052798936).
Almost surely, 210333232122021 is an apocalyptic number.
It is an amenable number.
10333232122021 is a deficient number, since it is larger than the sum of its proper divisors (527401465211).
10333232122021 is an equidigital number, since it uses as much as digits as its factorization.
10333232122021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23253288 (or 23253149 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 10333232122021 its reverse (12022123233301), we get a palindrome (22355355355322).
The spelling of 10333232122021 in words is "ten trillion, three hundred thirty-three billion, two hundred thirty-two million, one hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •