Base | Representation |
---|---|
bin | 1001001101001000000111… |
… | …0101110000001101000001 |
3 | 1022211120101100022212120002 |
4 | 2103102001311300031001 |
5 | 2311311024023120223 |
6 | 33305325014525345 |
7 | 2063140551411611 |
oct | 223220165601501 |
9 | 38746340285502 |
10 | 10121121301313 |
11 | 3252386132440 |
12 | 117565b066855 |
13 | 585557741099 |
14 | 26dc1735aa41 |
15 | 12841858ae28 |
hex | 93481d70341 |
10121121301313 has 32 divisors (see below), whose sum is σ = 11733165100800. Its totient is φ = 8639682796800.
The previous prime is 10121121301309. The next prime is 10121121301327. The reversal of 10121121301313 is 31310312112101.
It is not a de Polignac number, because 10121121301313 - 22 = 10121121301309 is a prime.
It is a super-4 number, since 4×101211213013134 (a number of 53 digits) contains 4444 as substring.
It is not an unprimeable number, because it can be changed into a prime (10121121301013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7211183 + ... + 8499611.
It is an arithmetic number, because the mean of its divisors is an integer number (366661409400).
Almost surely, 210121121301313 is an apocalyptic number.
It is an amenable number.
10121121301313 is a deficient number, since it is larger than the sum of its proper divisors (1612043799487).
10121121301313 is a wasteful number, since it uses less digits than its factorization.
10121121301313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1289033.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 10121121301313 its reverse (31310312112101), we get a palindrome (41431433413414).
The spelling of 10121121301313 in words is "ten trillion, one hundred twenty-one billion, one hundred twenty-one million, three hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •