Base | Representation |
---|---|
bin | 11110111000011110010… |
… | …010011110001100111010 |
3 | 21111212211022002220120000 |
4 | 132320132102132030322 |
5 | 234232302313044002 |
6 | 4302534010413430 |
7 | 306216432250233 |
oct | 36703622361472 |
9 | 7455738086500 |
10 | 2122222003002 |
11 | 749035aa3722 |
12 | 2a3373a31276 |
13 | 125180bb50ca |
14 | 74a04d6008a |
15 | 3a30d09961c |
hex | 1ee1e49e33a |
2122222003002 has 40 divisors (see below), whose sum is σ = 4781622017172. Its totient is φ = 703498996800.
The previous prime is 2122222002983. The next prime is 2122222003003. The reversal of 2122222003002 is 2003002222212.
2122222003002 is a `hidden beast` number, since 212 + 222 + 200 + 30 + 0 + 2 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 1188097820001 + 934124183001 = 1089999^2 + 966501^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (2122222003003) 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 19 ways as a sum of consecutive naturals, for example, 36158899 + ... + 36217542.
Almost surely, 22122222003002 is an apocalyptic number.
2122222003002 is an abundant number, since it is smaller than the sum of its proper divisors (2659400014170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2122222003002 is a wasteful number, since it uses less digits than its factorization.
2122222003002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72376636 (or 72376627 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 18.
Adding to 2122222003002 its reverse (2003002222212), we get a palindrome (4125224225214).
The spelling of 2122222003002 in words is "two trillion, one hundred twenty-two billion, two hundred twenty-two million, three thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •