Base | Representation |
---|---|
bin | 111000011111000101… |
… | …0011010000110001100 |
3 | 102121002202010001202010 |
4 | 1300332022122012030 |
5 | 3441411303000022 |
6 | 131420402501220 |
7 | 11522655662544 |
oct | 1607612320614 |
9 | 377082101663 |
10 | 121302000012 |
11 | 474978a8a96 |
12 | 1b613964810 |
13 | b591b7278b |
14 | 5c2a228324 |
15 | 324e43d50c |
hex | 1c3e29a18c |
121302000012 has 24 divisors (see below), whose sum is σ = 283057504576. Its totient is φ = 40431213648.
The previous prime is 121301999941. The next prime is 121302000013. The reversal of 121302000012 is 210000203121.
It is a super-2 number, since 2×1213020000122 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (121302000013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 162958 + ... + 518805.
Almost surely, 2121302000012 is an apocalyptic number.
121302000012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
121302000012 is an abundant number, since it is smaller than the sum of its proper divisors (161755504564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121302000012 is a wasteful number, since it uses less digits than its factorization.
121302000012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 696597 (or 696595 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 121302000012 its reverse (210000203121), we get a palindrome (331302203133).
The spelling of 121302000012 in words is "one hundred twenty-one billion, three hundred two million, twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •