Base | Representation |
---|---|
bin | 1001011001010110011011… |
… | …0011110101101011010001 |
3 | 1100120122102121012122211011 |
4 | 2112111212303311223101 |
5 | 2323231114012241423 |
6 | 33550015045450521 |
7 | 2114253546246532 |
oct | 226254663655321 |
9 | 40518377178734 |
10 | 10331121212113 |
11 | 3323449657629 |
12 | 11aa2a7710a41 |
13 | 59c2b3718c30 |
14 | 27a05957a689 |
15 | 12db098a1b0d |
hex | 96566cf5ad1 |
10331121212113 has 8 divisors (see below), whose sum is σ = 11213427749888. Its totient is φ = 9461329660944.
The previous prime is 10331121212099. The next prime is 10331121212123. The reversal of 10331121212113 is 31121212113301.
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 10331121212113 - 233 = 10322531277521 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10331121212123) 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, 3128744931 + ... + 3128748232.
It is an arithmetic number, because the mean of its divisors is an integer number (1401678468736).
Almost surely, 210331121212113 is an apocalyptic number.
10331121212113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10331121212113 is a deficient number, since it is larger than the sum of its proper divisors (882306537775).
10331121212113 is a wasteful number, since it uses less digits than its factorization.
10331121212113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6257493303.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 10331121212113 its reverse (31121212113301), we get a palindrome (41452333325414).
The spelling of 10331121212113 in words is "ten trillion, three hundred thirty-one billion, one hundred twenty-one million, two hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •