Base | Representation |
---|---|
bin | 1001010111101001111111… |
… | …0101111110001010101101 |
3 | 1100110212022000112120220210 |
4 | 2111322133311332022231 |
5 | 2322242010401121141 |
6 | 33524402442133033 |
7 | 2112203331141252 |
oct | 225723765761255 |
9 | 40425260476823 |
10 | 10302013301421 |
11 | 3312071a32496 |
12 | 11a47234b1179 |
13 | 59962510a93a |
14 | 2788977cd429 |
15 | 12cea4240916 |
hex | 95e9fd7e2ad |
10302013301421 has 8 divisors (see below), whose sum is σ = 13756861467360. Its totient is φ = 6857587001552.
The previous prime is 10302013301399. The next prime is 10302013301483. The reversal of 10302013301421 is 12410331020301.
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 10302013301421 - 221 = 10302011204269 is a prime.
It is a super-2 number, since 2×103020133014212 (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 (10302013302421) 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, 2605464210 + ... + 2605468163.
It is an arithmetic number, because the mean of its divisors is an integer number (1719607683420).
Almost surely, 210302013301421 is an apocalyptic number.
It is an amenable number.
10302013301421 is a deficient number, since it is larger than the sum of its proper divisors (3454848165939).
10302013301421 is an equidigital number, since it uses as much as digits as its factorization.
10302013301421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5210933035.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 10302013301421 its reverse (12410331020301), we get a palindrome (22712344321722).
The spelling of 10302013301421 in words is "ten trillion, three hundred two billion, thirteen million, three hundred one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •