Base | Representation |
---|---|
bin | 1001101100110010010010… |
… | …00011000001011101101011 |
3 | 2210112010112200102120220120 |
4 | 10312121021003001131223 |
5 | 10243432401434334011 |
6 | 113210514255454323 |
7 | 4331021051020230 |
oct | 466311103013553 |
9 | 83463480376816 |
10 | 21330033121131 |
11 | 688401a695699 |
12 | 2485aa0b273a3 |
13 | bb954b59ba67 |
14 | 53a5443d3787 |
15 | 26ec9a778a06 |
hex | 1366490c176b |
21330033121131 has 32 divisors (see below), whose sum is σ = 34324705013760. Its totient is φ = 11518185939744.
The previous prime is 21330033121099. The next prime is 21330033121139. The reversal of 21330033121131 is 13112133003312.
It is not a de Polignac number, because 21330033121131 - 25 = 21330033121099 is a prime.
It is a super-2 number, since 2×213300331211312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (21330033121139) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 265993401 + ... + 266073578.
It is an arithmetic number, because the mean of its divisors is an integer number (1072647031680).
Almost surely, 221330033121131 is an apocalyptic number.
21330033121131 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
21330033121131 is a deficient number, since it is larger than the sum of its proper divisors (12994671892629).
21330033121131 is a wasteful number, since it uses less digits than its factorization.
21330033121131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 532067095.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 21330033121131 its reverse (13112133003312), we get a palindrome (34442166124443).
The spelling of 21330033121131 in words is "twenty-one trillion, three hundred thirty billion, thirty-three million, one hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •