Base | Representation |
---|---|
bin | 11001000010001100101011… |
… | …001111000110011111100010 |
3 | 112102211200001110110222101020 |
4 | 121002030223033012133202 |
5 | 103412403312233341002 |
6 | 1030100131413550310 |
7 | 32122423311343620 |
oct | 3102145317063742 |
9 | 472750043428336 |
10 | 110102212012002 |
11 | 3209a0a435a691 |
12 | 10422668045396 |
13 | 4958795159b32 |
14 | 1d28d92a88510 |
15 | cae027c3d2bc |
hex | 64232b3c67e2 |
110102212012002 has 64 divisors (see below), whose sum is σ = 262803129937920. Its totient is φ = 30067232399424.
The previous prime is 110102212011949. The next prime is 110102212012033. The reversal of 110102212012002 is 200210212201011.
It is a super-3 number, since 3×1101022120120023 (a number of 43 digits) contains 333 as substring.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 41931853 + ... + 44480160.
It is an arithmetic number, because the mean of its divisors is an integer number (4106298905280).
Almost surely, 2110102212012002 is an apocalyptic number.
110102212012002 is an abundant number, since it is smaller than the sum of its proper divisors (152700917925918).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110102212012002 is a wasteful number, since it uses less digits than its factorization.
110102212012002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86413367.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 110102212012002 its reverse (200210212201011), we get a palindrome (310312424213013).
The spelling of 110102212012002 in words is "one hundred ten trillion, one hundred two billion, two hundred twelve million, twelve thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •