Base | Representation |
---|---|
bin | 1001011000001111001111… |
… | …1000111110100111011001 |
3 | 1100111211002221022200101122 |
4 | 2112003303320332213121 |
5 | 2322423000401413200 |
6 | 33533135025055025 |
7 | 2113006205621411 |
oct | 226036370764731 |
9 | 40454087280348 |
10 | 10312013310425 |
11 | 3316333753242 |
12 | 11a6654487475 |
13 | 59a559acc228 |
14 | 279165955641 |
15 | 12d38c101385 |
hex | 960f3e3e9d9 |
10312013310425 has 12 divisors (see below), whose sum is σ = 12824839828476. Its totient is φ = 8225131084800.
The previous prime is 10312013310383. The next prime is 10312013310439. The reversal of 10312013310425 is 52401331021301.
It can be written as a sum of positive squares in 6 ways, for example, as 465653382544 + 9846359927881 = 682388^2 + 3137891^2 .
It is not a de Polignac number, because 10312013310425 - 232 = 10307718343129 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10312013310394 and 10312013310403.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 611980496 + ... + 611997345.
It is an arithmetic number, because the mean of its divisors is an integer number (1068736652373).
Almost surely, 210312013310425 is an apocalyptic number.
It is an amenable number.
10312013310425 is a deficient number, since it is larger than the sum of its proper divisors (2512826518051).
10312013310425 is a wasteful number, since it uses less digits than its factorization.
10312013310425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1223978188 (or 1223978183 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 10312013310425 its reverse (52401331021301), we get a palindrome (62713344331726).
The spelling of 10312013310425 in words is "ten trillion, three hundred twelve billion, thirteen million, three hundred ten thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •