Base | Representation |
---|---|
bin | 1001001101001000001001… |
… | …0111110010000110111101 |
3 | 1022211120101222010002110101 |
4 | 2103102002113302012331 |
5 | 2311311033314101023 |
6 | 33305325534041101 |
7 | 2063141020264516 |
oct | 223220227620675 |
9 | 38746358102411 |
10 | 10121130222013 |
11 | 3252390175718 |
12 | 1175662049191 |
13 | 5855595455c5 |
14 | 26dc185dda0d |
15 | 12841924e1ad |
hex | 934825f21bd |
10121130222013 has 4 divisors (see below), whose sum is σ = 10121744124000. Its totient is φ = 10120516320028.
The previous prime is 10121130221999. The next prime is 10121130222017. The reversal of 10121130222013 is 31022203112101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10121130222013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10121130222017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 306926263 + ... + 306959236.
It is an arithmetic number, because the mean of its divisors is an integer number (2530436031000).
Almost surely, 210121130222013 is an apocalyptic number.
It is an amenable number.
10121130222013 is a deficient number, since it is larger than the sum of its proper divisors (613901987).
10121130222013 is an equidigital number, since it uses as much as digits as its factorization.
10121130222013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 613901986.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 10121130222013 its reverse (31022203112101), we get a palindrome (41143333334114).
The spelling of 10121130222013 in words is "ten trillion, one hundred twenty-one billion, one hundred thirty million, two hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •