Base | Representation |
---|---|
bin | 1001010111101001111111… |
… | …0001110011110011111111 |
3 | 1100110212021221111011100202 |
4 | 2111322133301303303333 |
5 | 2322242010111213211 |
6 | 33524402402514115 |
7 | 2112203315645444 |
oct | 225723761636377 |
9 | 40425257434322 |
10 | 10302012210431 |
11 | 3312071357847 |
12 | 11a472306593b |
13 | 599624b18196 |
14 | 2788975c79cb |
15 | 12cea40c753b |
hex | 95e9fc73cff |
10302012210431 has 8 divisors (see below), whose sum is σ = 10328137797264. Its totient is φ = 10275887508480.
The previous prime is 10302012210419. The next prime is 10302012210439. The reversal of 10302012210431 is 13401221020301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10302012210431 is a prime.
It is a super-2 number, since 2×103020122104312 (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 (10302012210439) 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, 27481151 + ... + 27853503.
It is an arithmetic number, because the mean of its divisors is an integer number (1291017224658).
Almost surely, 210302012210431 is an apocalyptic number.
10302012210431 is a deficient number, since it is larger than the sum of its proper divisors (26125586833).
10302012210431 is an equidigital number, since it uses as much as digits as its factorization.
10302012210431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 442441.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 10302012210431 its reverse (13401221020301), we get a palindrome (23703233230732).
The spelling of 10302012210431 in words is "ten trillion, three hundred two billion, twelve million, two hundred ten thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •