Base | Representation |
---|---|
bin | 1001001101001011110101… |
… | …1000010010011011001001 |
3 | 1022211122221221221200211121 |
4 | 2103102331120102123021 |
5 | 2311320100233210441 |
6 | 33310012100555241 |
7 | 2063204401116313 |
oct | 223227530223311 |
9 | 38748857850747 |
10 | 10122120210121 |
11 | 3252848a80407 |
12 | 11758996b2b21 |
13 | 58568668869a |
14 | 26dcadca27b3 |
15 | 128476103dd1 |
hex | 934bd6126c9 |
10122120210121 has 8 divisors (see below), whose sum is σ = 10206121956800. Its totient is φ = 10038449832048.
The previous prime is 10122120210119. The next prime is 10122120210179. The reversal of 10122120210121 is 12101202122101.
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 10122120210121 - 21 = 10122120210119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10122120210095 and 10122120210104.
It is not an unprimeable number, because it can be changed into a prime (10122120210821) 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, 82780806 + ... + 82902991.
It is an arithmetic number, because the mean of its divisors is an integer number (1275765244600).
Almost surely, 210122120210121 is an apocalyptic number.
It is an amenable number.
10122120210121 is a deficient number, since it is larger than the sum of its proper divisors (84001746679).
10122120210121 is a wasteful number, since it uses less digits than its factorization.
10122120210121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165684303.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 10122120210121 its reverse (12101202122101), we get a palindrome (22223322332222).
The spelling of 10122120210121 in words is "ten trillion, one hundred twenty-two billion, one hundred twenty million, two hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •