Base | Representation |
---|---|
bin | 10011100011111001… |
… | …001110110100011010 |
3 | 2000012202102012021112 |
4 | 103203321032310122 |
5 | 321003321100442 |
6 | 13352045340322 |
7 | 1342324051100 |
oct | 234371166432 |
9 | 60182365245 |
10 | 21003300122 |
11 | 89a88a7282 |
12 | 40a1b676a2 |
13 | 1c994cbc4c |
14 | 1033651c70 |
15 | 82dda0082 |
hex | 4e3e4ed1a |
21003300122 has 36 divisors (see below), whose sum is σ = 37445349834. Its totient is φ = 8809804080.
The previous prime is 21003300061. The next prime is 21003300173. The reversal of 21003300122 is 22100330012.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 20106956401 + 896343721 = 141799^2 + 29939^2 .
It is a super-2 number, since 2×210033001222 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 21003300097 and 21003300106.
It is an unprimeable number.
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 17 ways as a sum of consecutive naturals, for example, 167972 + ... + 264992.
Almost surely, 221003300122 is an apocalyptic number.
21003300122 is a deficient number, since it is larger than the sum of its proper divisors (16442049712).
21003300122 is an equidigital number, since it uses as much as digits as its factorization.
21003300122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97131 (or 97077 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 21003300122 its reverse (22100330012), we get a palindrome (43103630134).
It can be divided in two parts, 2100330012 and 2, that multiplied together give a palindrome (4200660024).
The spelling of 21003300122 in words is "twenty-one billion, three million, three hundred thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •