Base | Representation |
---|---|
bin | 10111001100010100000010… |
… | …100111100000000010111010 |
3 | 111101011012222112222200122122 |
4 | 113030110002213200002322 |
5 | 101332142000342101020 |
6 | 1000534414204121242 |
7 | 30325226242310636 |
oct | 2714240247400272 |
9 | 441135875880578 |
10 | 102001222222010 |
11 | 2a5565258614a1 |
12 | b53462ab36222 |
13 | 44bb89b9823b7 |
14 | 1b28c57b37dc6 |
15 | bbd444c27125 |
hex | 5cc5029e00ba |
102001222222010 has 16 divisors (see below), whose sum is σ = 184616576798472. Its totient is φ = 40575071822400.
The previous prime is 102001222221979. The next prime is 102001222222049. The reversal of 102001222222010 is 10222222100201.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 27433386060721 + 74567836161289 = 5237689^2 + 8635267^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 102001222222010.
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 7 ways as a sum of consecutive naturals, for example, 28177131401 + ... + 28177135020.
Almost surely, 2102001222222010 is an apocalyptic number.
102001222222010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102001222222010 is a deficient number, since it is larger than the sum of its proper divisors (82615354576462).
102001222222010 is a wasteful number, since it uses less digits than its factorization.
102001222222010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56354266609.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 102001222222010 its reverse (10222222100201), we get a palindrome (112223444322211).
The spelling of 102001222222010 in words is "one hundred two trillion, one billion, two hundred twenty-two million, two hundred twenty-two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •