Base | Representation |
---|---|
bin | 11011100000111011010110… |
… | …101011000001111110010001 |
3 | 120212110102222200011102001202 |
4 | 123200323112223001332101 |
5 | 111330112000102431001 |
6 | 1105211121540440545 |
7 | 34326453601225454 |
oct | 3340732653017621 |
9 | 525412880142052 |
10 | 121010010202001 |
11 | 3561506a042018 |
12 | 116a46736a9155 |
13 | 526a26c54545b |
14 | 21c4cb6b3349b |
15 | decb34ae296b |
hex | 6e0ed6ac1f91 |
121010010202001 has 8 divisors (see below), whose sum is σ = 121183229687520. Its totient is φ = 120836831910912.
The previous prime is 121010010201979. The next prime is 121010010202019. The reversal of 121010010202001 is 100202010010121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 121010010202001 - 222 = 121010006007697 is a prime.
It is a super-2 number, since 2×1210100102020012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121010010202051) 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, 4416935 + ... + 16171868.
It is an arithmetic number, because the mean of its divisors is an integer number (15147903710940).
Almost surely, 2121010010202001 is an apocalyptic number.
It is an amenable number.
121010010202001 is a deficient number, since it is larger than the sum of its proper divisors (173219485519).
121010010202001 is an equidigital number, since it uses as much as digits as its factorization.
121010010202001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20597215.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 121010010202001 its reverse (100202010010121), we get a palindrome (221212020212122).
The spelling of 121010010202001 in words is "one hundred twenty-one trillion, ten billion, ten million, two hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •