Base | Representation |
---|---|
bin | 1001001101001000110100… |
… | …1110010111000100010101 |
3 | 1022211120212122201200022220 |
4 | 2103102031032113010111 |
5 | 2311311421422120313 |
6 | 33305400000412553 |
7 | 2063145361033152 |
oct | 223221516270425 |
9 | 38746778650286 |
10 | 10121312301333 |
11 | 3252473a285a2 |
12 | 11756b3017159 |
13 | 585588196a4c |
14 | 26dc34879229 |
15 | 12842a218823 |
hex | 9348d397115 |
10121312301333 has 8 divisors (see below), whose sum is σ = 13500398196000. Its totient is φ = 6744883970448.
The previous prime is 10121312301313. The next prime is 10121312301361. The reversal of 10121312301333 is 33310321312101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-10121312301333 is a prime.
It is a super-2 number, since 2×101213123013332 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10121312301313) 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, 664382058 + ... + 664397291.
It is an arithmetic number, because the mean of its divisors is an integer number (1687549774500).
Almost surely, 210121312301333 is an apocalyptic number.
It is an amenable number.
10121312301333 is a deficient number, since it is larger than the sum of its proper divisors (3379085894667).
10121312301333 is a wasteful number, since it uses less digits than its factorization.
10121312301333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1328781891.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 10121312301333 its reverse (33310321312101), we get a palindrome (43431633613434).
The spelling of 10121312301333 in words is "ten trillion, one hundred twenty-one billion, three hundred twelve million, three hundred one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •