Base | Representation |
---|---|
bin | 111000010110011000… |
… | …0100001100001010001 |
3 | 102120100101200000202222 |
4 | 1300230300201201101 |
5 | 3440312030031001 |
6 | 131331412150425 |
7 | 11512512021440 |
oct | 1605460414121 |
9 | 376311600688 |
10 | 121010002001 |
11 | 47357a9a619 |
12 | 1b552008415 |
13 | b546516ca5 |
14 | 5bdd538d57 |
15 | 32339b061b |
hex | 1c2cc21851 |
121010002001 has 8 divisors (see below), whose sum is σ = 138796415040. Its totient is φ = 103348406448.
The previous prime is 121010001989. The next prime is 121010002013. The reversal of 121010002001 is 100200010121.
It is an interprime number because it is at equal distance from previous prime (121010001989) and next prime (121010002013).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121010002001 - 214 = 121009985617 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 121010002001.
It is not an unprimeable number, because it can be changed into a prime (121010002501) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31202291 + ... + 31206168.
It is an arithmetic number, because the mean of its divisors is an integer number (17349551880).
Almost surely, 2121010002001 is an apocalyptic number.
It is an amenable number.
121010002001 is a deficient number, since it is larger than the sum of its proper divisors (17786413039).
121010002001 is an equidigital number, since it uses as much as digits as its factorization.
121010002001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62408743.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 121010002001 its reverse (100200010121), we get a palindrome (221210012122).
The spelling of 121010002001 in words is "one hundred twenty-one billion, ten million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •