Base | Representation |
---|---|
bin | 11011010011101011110101… |
… | …111010001011110000110001 |
3 | 120202020110002120200101221002 |
4 | 123103223311322023300301 |
5 | 111220204300301414301 |
6 | 1103233102345411345 |
7 | 34203636663314540 |
oct | 3323536572136061 |
9 | 522213076611832 |
10 | 120100001201201 |
11 | 352a414074a83a |
12 | 11578227499b55 |
13 | 52024c626a088 |
14 | 2192c2a324157 |
15 | dd4123a2b16b |
hex | 6d3af5e8bc31 |
120100001201201 has 4 divisors (see below), whose sum is σ = 137257144229952. Its totient is φ = 102942858172452.
The previous prime is 120100001201177. The next prime is 120100001201209. The reversal of 120100001201201 is 102102100001021.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 120100001201201 - 210 = 120100001200177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120100001201209) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8578571514365 + ... + 8578571514378.
It is an arithmetic number, because the mean of its divisors is an integer number (34314286057488).
Almost surely, 2120100001201201 is an apocalyptic number.
It is an amenable number.
120100001201201 is a deficient number, since it is larger than the sum of its proper divisors (17157143028751).
120100001201201 is an equidigital number, since it uses as much as digits as its factorization.
120100001201201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17157143028750.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 120100001201201 its reverse (102102100001021), we get a palindrome (222202101202222).
The spelling of 120100001201201 in words is "one hundred twenty trillion, one hundred billion, one million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •