Base | Representation |
---|---|
bin | 10011110001100101… |
… | …100101011110111110 |
3 | 2000210202200201221100 |
4 | 103301211211132332 |
5 | 321441123443402 |
6 | 13430533313530 |
7 | 1351113533523 |
oct | 236145453676 |
9 | 60722621840 |
10 | 21233031102 |
11 | 9006546598 |
12 | 4146a958a6 |
13 | 2004c9593a |
14 | 1055d7314a |
15 | 84412d71c |
hex | 4f19657be |
21233031102 has 12 divisors (see below), whose sum is σ = 46004900760. Its totient is φ = 7077677028.
The previous prime is 21233031077. The next prime is 21233031109. The reversal of 21233031102 is 20113033212.
21233031102 is a `hidden beast` number, since 21 + 2 + 330 + 311 + 0 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 1179612839 = 21233031102 / (2 + 1 + 2 + 3 + 3 + 0 + 3 + 1 + 1 + 0 + 2).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21233031109) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 589806402 + ... + 589806437.
It is an arithmetic number, because the mean of its divisors is an integer number (3833741730).
Almost surely, 221233031102 is an apocalyptic number.
21233031102 is an abundant number, since it is smaller than the sum of its proper divisors (24771869658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21233031102 is a wasteful number, since it uses less digits than its factorization.
21233031102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1179612847 (or 1179612844 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 21233031102 its reverse (20113033212), we get a palindrome (41346064314).
The spelling of 21233031102 in words is "twenty-one billion, two hundred thirty-three million, thirty-one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •