Base | Representation |
---|---|
bin | 1001010111101001111110… |
… | …1001111000101001101101 |
3 | 1100110212021210120121210121 |
4 | 2111322133221320221231 |
5 | 2322242004043224401 |
6 | 33524402250204541 |
7 | 2112203262204211 |
oct | 225723751705155 |
9 | 40425253517717 |
10 | 10302010133101 |
11 | 3312070169045 |
12 | 11a4722423751 |
13 | 59962456b7ab |
14 | 278897206941 |
15 | 12cea3d16ca1 |
hex | 95e9fa78a6d |
10302010133101 has 8 divisors (see below), whose sum is σ = 10477390105440. Its totient is φ = 10126655815248.
The previous prime is 10302010133021. The next prime is 10302010133119. The reversal of 10302010133101 is 10133101020301.
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 10302010133101 - 213 = 10302010124909 is a prime.
It is a super-2 number, since 2×103020101331012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10302010133801) 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, 5602786 + ... + 7210771.
It is an arithmetic number, because the mean of its divisors is an integer number (1309673763180).
Almost surely, 210302010133101 is an apocalyptic number.
It is an amenable number.
10302010133101 is a deficient number, since it is larger than the sum of its proper divisors (175379972339).
10302010133101 is a wasteful number, since it uses less digits than its factorization.
10302010133101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12827243.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 10302010133101 its reverse (10133101020301), we get a palindrome (20435111153402).
The spelling of 10302010133101 in words is "ten trillion, three hundred two billion, ten million, one hundred thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •