Base | Representation |
---|---|
bin | 1011000001100011000100… |
… | …1000111000001010100110 |
3 | 1120220202222210212211220101 |
4 | 2300120301020320022212 |
5 | 3042043230330320402 |
6 | 41440225040454314 |
7 | 2360505120022204 |
oct | 260306110701246 |
9 | 46822883784811 |
10 | 12121222120102 |
11 | 3953643983937 |
12 | 143921091a39a |
13 | 69c045b44834 |
14 | 2dc955372074 |
15 | 16047a330b87 |
hex | b06312382a6 |
12121222120102 has 8 divisors (see below), whose sum is σ = 18604666510056. Its totient is φ = 5919666616752.
The previous prime is 12121222120001. The next prime is 12121222120103. The reversal of 12121222120102 is 20102122212121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 12121222120102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12121222120103) 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 3 ways as a sum of consecutive naturals, for example, 70472221543 + ... + 70472221714.
It is an arithmetic number, because the mean of its divisors is an integer number (2325583313757).
Almost surely, 212121222120102 is an apocalyptic number.
12121222120102 is a deficient number, since it is larger than the sum of its proper divisors (6483444389954).
12121222120102 is a wasteful number, since it uses less digits than its factorization.
12121222120102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140944443302.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 12121222120102 its reverse (20102122212121), we get a palindrome (32223344332223).
The spelling of 12121222120102 in words is "twelve trillion, one hundred twenty-one billion, two hundred twenty-two million, one hundred twenty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •