Base | Representation |
---|---|
bin | 1001010111100110101000… |
… | …1011101000111100110011 |
3 | 1100110202222021111011000212 |
4 | 2111321222023220330303 |
5 | 2322233134412341034 |
6 | 33524133241534335 |
7 | 2112142116615644 |
oct | 225715213507463 |
9 | 40422867434025 |
10 | 10301113012019 |
11 | 331174a822765 |
12 | 11a4511aa43ab |
13 | 59951074260b |
14 | 27880ddd96cb |
15 | 12ce501a82ce |
hex | 95e6a2e8f33 |
10301113012019 has 8 divisors (see below), whose sum is σ = 10520485270848. Its totient is φ = 10081749071680.
The previous prime is 10301113012007. The next prime is 10301113012067. The reversal of 10301113012019 is 91021031110301.
It is a happy number.
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 10301113012019 - 228 = 10300844576563 is a prime.
It is a super-2 number, since 2×103011130120192 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10301113011985 and 10301113012003.
It is not an unprimeable number, because it can be changed into a prime (10301113012219) 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, 455999 + ... + 4561815.
It is an arithmetic number, because the mean of its divisors is an integer number (1315060658856).
Almost surely, 210301113012019 is an apocalyptic number.
10301113012019 is a deficient number, since it is larger than the sum of its proper divisors (219372258829).
10301113012019 is an equidigital number, since it uses as much as digits as its factorization.
10301113012019 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4159245.
The product of its (nonzero) digits is 162, while the sum is 23.
The spelling of 10301113012019 in words is "ten trillion, three hundred one billion, one hundred thirteen million, twelve thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •