Base | Representation |
---|---|
bin | 1001010011100010111111… |
… | …0100100010110001001001 |
3 | 1100020010001212020220122122 |
4 | 2110320233310202301021 |
5 | 2320112414041331441 |
6 | 33432125154501025 |
7 | 2104123662325433 |
oct | 224705764426111 |
9 | 40203055226578 |
10 | 10231414402121 |
11 | 3295133774520 |
12 | 1192abbb94775 |
13 | 592a83891703 |
14 | 2752bb439653 |
15 | 12b22127d34b |
hex | 94e2fd22c49 |
10231414402121 has 8 divisors (see below), whose sum is σ = 11372138135424. Its totient is φ = 9125789860720.
The previous prime is 10231414402109. The next prime is 10231414402199. The reversal of 10231414402121 is 12120441413201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10231414402121 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10231414402921) 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, 8774797361 + ... + 8774798526.
It is an arithmetic number, because the mean of its divisors is an integer number (1421517266928).
Almost surely, 210231414402121 is an apocalyptic number.
10231414402121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10231414402121 is a deficient number, since it is larger than the sum of its proper divisors (1140723733303).
10231414402121 is a wasteful number, since it uses less digits than its factorization.
10231414402121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17549595951.
The product of its (nonzero) digits is 1536, while the sum is 26.
Adding to 10231414402121 its reverse (12120441413201), we get a palindrome (22351855815322).
The spelling of 10231414402121 in words is "ten trillion, two hundred thirty-one billion, four hundred fourteen million, four hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •