Base | Representation |
---|---|
bin | 10111000000110011010000… |
… | …000111100111010111011001 |
3 | 111021100120221221212121221111 |
4 | 113000303100013213113121 |
5 | 101231211241330120441 |
6 | 555131140055140321 |
7 | 30214121440121452 |
oct | 2700632007472731 |
9 | 437316857777844 |
10 | 101210101020121 |
11 | 2a280a65536185 |
12 | b4272420746a1 |
13 | 44620c132b022 |
14 | 1adc848a78129 |
15 | ba7a91170081 |
hex | 5c0cd01e75d9 |
101210101020121 has 16 divisors (see below), whose sum is σ = 106262419622400. Its totient is φ = 96270022051200.
The previous prime is 101210101020113. The next prime is 101210101020151. The reversal of 101210101020121 is 121020101012101.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 101210101020121 - 23 = 101210101020113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101210101020151) 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 15 ways as a sum of consecutive naturals, for example, 7284615 + ... + 15983923.
It is an arithmetic number, because the mean of its divisors is an integer number (6641401226400).
Almost surely, 2101210101020121 is an apocalyptic number.
It is an amenable number.
101210101020121 is a deficient number, since it is larger than the sum of its proper divisors (5052318602279).
101210101020121 is an equidigital number, since it uses as much as digits as its factorization.
101210101020121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8705760.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101210101020121 its reverse (121020101012101), we get a palindrome (222230202032222).
The spelling of 101210101020121 in words is "one hundred one trillion, two hundred ten billion, one hundred one million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •