Base | Representation |
---|---|
bin | 111000011100010101… |
… | …1110110010110100001 |
3 | 102120212100012020000112 |
4 | 1300320223312112201 |
5 | 3441214241300301 |
6 | 131403321101105 |
7 | 11520461610035 |
oct | 1607053662641 |
9 | 376770166015 |
10 | 121210103201 |
11 | 4744aa41610 |
12 | 1b5a9027795 |
13 | b578b08375 |
14 | 5c1bd461c5 |
15 | 32463399bb |
hex | 1c38af65a1 |
121210103201 has 8 divisors (see below), whose sum is σ = 137978299584. Its totient is φ = 105400089520.
The previous prime is 121210103197. The next prime is 121210103227. The reversal of 121210103201 is 102301012121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121210103201 - 22 = 121210103197 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (121210183201) by changing a digit.
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, 239545406 + ... + 239545911.
It is an arithmetic number, because the mean of its divisors is an integer number (17247287448).
Almost surely, 2121210103201 is an apocalyptic number.
121210103201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
121210103201 is a deficient number, since it is larger than the sum of its proper divisors (16768196383).
121210103201 is a wasteful number, since it uses less digits than its factorization.
121210103201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 479091351.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 121210103201 its reverse (102301012121), we get a palindrome (223511115322).
The spelling of 121210103201 in words is "one hundred twenty-one billion, two hundred ten million, one hundred three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •