Base | Representation |
---|---|
bin | 1001100110011100001010… |
… | …10001001011100001110001 |
3 | 2202202021202120220012111111 |
4 | 10303032011101023201301 |
5 | 10231344334013230413 |
6 | 112522415144113321 |
7 | 4306202021136412 |
oct | 463160521134161 |
9 | 82667676805444 |
10 | 21112000133233 |
11 | 67aa604760809 |
12 | 244b792165841 |
13 | ba1b1226c359 |
14 | 52db7d379809 |
15 | 2692890d1d3d |
hex | 13338544b871 |
21112000133233 has 8 divisors (see below), whose sum is σ = 22040145427968. Its totient is φ = 20184707525664.
The previous prime is 21112000133207. The next prime is 21112000133281. The reversal of 21112000133233 is 33233100021112.
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 21112000133233 - 233 = 21103410198641 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21112000133633) 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, 213121185 + ... + 213220222.
It is an arithmetic number, because the mean of its divisors is an integer number (2755018178496).
Almost surely, 221112000133233 is an apocalyptic number.
21112000133233 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
21112000133233 is a deficient number, since it is larger than the sum of its proper divisors (928145294735).
21112000133233 is a wasteful number, since it uses less digits than its factorization.
21112000133233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 426343583.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 21112000133233 its reverse (33233100021112), we get a palindrome (54345100154345).
The spelling of 21112000133233 in words is "twenty-one trillion, one hundred twelve billion, one hundred thirty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •