Base | Representation |
---|---|
bin | 11011110000110100100010… |
… | …110111000101000100010010 |
3 | 121000022212010222000001120200 |
4 | 123300310202313011010102 |
5 | 112001010311242401002 |
6 | 1111404551515320030 |
7 | 34501410410325135 |
oct | 3360644267050422 |
9 | 530285128001520 |
10 | 122102210122002 |
11 | 359a6290463500 |
12 | 11840287150016 |
13 | 531925c337376 |
14 | 2221ac82d421c |
15 | e1b25a8d8b1c |
hex | 6f0d22dc5112 |
122102210122002 has 36 divisors (see below), whose sum is σ = 290791627141470. Its totient is φ = 37000669733280.
The previous prime is 122102210121979. The next prime is 122102210122027. The reversal of 122102210122002 is 200221012201221.
It is a happy number.
122102210122002 is a `hidden beast` number, since 1 + 221 + 0 + 221 + 0 + 1 + 220 + 0 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 121421203918641 + 681006203361 = 11019129^2 + 825231^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 28030808227 + ... + 28030812582.
Almost surely, 2122102210122002 is an apocalyptic number.
122102210122002 is an abundant number, since it is smaller than the sum of its proper divisors (168689417019468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122102210122002 is a wasteful number, since it uses less digits than its factorization.
122102210122002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56061620839 (or 56061620825 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 122102210122002 its reverse (200221012201221), we get a palindrome (322323222323223).
The spelling of 122102210122002 in words is "one hundred twenty-two trillion, one hundred two billion, two hundred ten million, one hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •