Base | Representation |
---|---|
bin | 111000110011111010… |
… | …0111000011001001100 |
3 | 102122220110101221111000 |
4 | 1301213310320121030 |
5 | 3444324224000022 |
6 | 132014012500300 |
7 | 11546204250453 |
oct | 1614764703114 |
9 | 378813357430 |
10 | 122001000012 |
11 | 47816425041 |
12 | 1b789a7a690 |
13 | b673921948 |
14 | 5c94dc1b9a |
15 | 32909b46ac |
hex | 1c67d3864c |
122001000012 has 48 divisors (see below), whose sum is σ = 316866906720. Its totient is φ = 40593969216.
The previous prime is 122001000001. The next prime is 122001000029. The reversal of 122001000012 is 210000100221.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 122000999958 and 122001000003.
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 15 ways as a sum of consecutive naturals, for example, 953883 + ... + 1074194.
It is an arithmetic number, because the mean of its divisors is an integer number (6601393890).
Almost surely, 2122001000012 is an apocalyptic number.
122001000012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
122001000012 is an abundant number, since it is smaller than the sum of its proper divisors (194865906708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122001000012 is a wasteful number, since it uses less digits than its factorization.
122001000012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2028647 (or 2028639 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 122001000012 its reverse (210000100221), we get a palindrome (332001100233).
The spelling of 122001000012 in words is "one hundred twenty-two billion, one million, twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.284 sec. • engine limits •