Base | Representation |
---|---|
bin | 1001100110011100100110… |
… | …00101110011001100111001 |
3 | 2202202022100202020211110220 |
4 | 10303032103011303030321 |
5 | 10231400322344443113 |
6 | 112522454150330253 |
7 | 4306210535215323 |
oct | 463162305631471 |
9 | 82668322224426 |
10 | 21112232031033 |
11 | 67aa71364aa90 |
12 | 244b837959989 |
13 | ba1b4b3143a0 |
14 | 52dba20a2613 |
15 | 26929e63c523 |
hex | 133393173339 |
21112232031033 has 16 divisors (see below), whose sum is σ = 33070908916416. Its totient is φ = 11811038898240.
The previous prime is 21112232031019. The next prime is 21112232031041. The reversal of 21112232031033 is 33013023221112.
It is not a de Polignac number, because 21112232031033 - 26 = 21112232030969 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21112232030994 and 21112232031012.
It is not an unprimeable number, because it can be changed into a prime (21112232031133) 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 15 ways as a sum of consecutive naturals, for example, 24606330610 + ... + 24606331467.
It is an arithmetic number, because the mean of its divisors is an integer number (2066931807276).
Almost surely, 221112232031033 is an apocalyptic number.
It is an amenable number.
21112232031033 is a deficient number, since it is larger than the sum of its proper divisors (11958676885383).
21112232031033 is a wasteful number, since it uses less digits than its factorization.
21112232031033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49212662104.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 21112232031033 its reverse (33013023221112), we get a palindrome (54125255252145).
The spelling of 21112232031033 in words is "twenty-one trillion, one hundred twelve billion, two hundred thirty-two million, thirty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •