Base | Representation |
---|---|
bin | 10001011110101101001… |
… | …110000001111111011001 |
3 | 11020211111211111122121220 |
4 | 101132231032001333121 |
5 | 124140030203341441 |
6 | 2315454035522253 |
7 | 152532622431366 |
oct | 21365516017731 |
9 | 4224454448556 |
10 | 1201202012121 |
11 | 423477247641 |
12 | 174974159389 |
13 | 89371634c97 |
14 | 421d201d46d |
15 | 213a54c2466 |
hex | 117ad381fd9 |
1201202012121 has 8 divisors (see below), whose sum is σ = 1601607928704. Its totient is φ = 800798718480.
The previous prime is 1201202012111. The next prime is 1201202012141. The reversal of 1201202012121 is 1212102021021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1201202012121 - 217 = 1201201881049 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1201202012121.
It is not an unprimeable number, because it can be changed into a prime (1201202012111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1037311 + ... + 1865051.
It is an arithmetic number, because the mean of its divisors is an integer number (200200991088).
Almost surely, 21201202012121 is an apocalyptic number.
It is an amenable number.
1201202012121 is a deficient number, since it is larger than the sum of its proper divisors (400405916583).
1201202012121 is an equidigital number, since it uses as much as digits as its factorization.
1201202012121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1311471.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1201202012121 its reverse (1212102021021), we get a palindrome (2413304033142).
The spelling of 1201202012121 in words is "one trillion, two hundred one billion, two hundred two million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •