Base | Representation |
---|---|
bin | 1001010111101010011001… |
… | …0001101100111010110101 |
3 | 1100110212120112122010201110 |
4 | 2111322212101230322311 |
5 | 2322242221013442401 |
6 | 33524421255345233 |
7 | 2112206111432634 |
oct | 225724621547265 |
9 | 40425515563643 |
10 | 10302121234101 |
11 | 3312117951954 |
12 | 11a4753682219 |
13 | 59964159b028 |
14 | 2788a7c8751b |
15 | 12cead9609d6 |
hex | 95ea646ceb5 |
10302121234101 has 8 divisors (see below), whose sum is σ = 13828350650400. Its totient is φ = 6821986320272.
The previous prime is 10302121234087. The next prime is 10302121234177. The reversal of 10302121234101 is 10143212120301.
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 10302121234101 - 27 = 10302121233973 is a prime.
It is a super-2 number, since 2×103021212341012 (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 (10302121234001) 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, 11523625095 + ... + 11523625988.
It is an arithmetic number, because the mean of its divisors is an integer number (1728543831300).
Almost surely, 210302121234101 is an apocalyptic number.
It is an amenable number.
10302121234101 is a deficient number, since it is larger than the sum of its proper divisors (3526229416299).
10302121234101 is a wasteful number, since it uses less digits than its factorization.
10302121234101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23047251235.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 10302121234101 its reverse (10143212120301), we get a palindrome (20445333354402).
The spelling of 10302121234101 in words is "ten trillion, three hundred two billion, one hundred twenty-one million, two hundred thirty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •