Base | Representation |
---|---|
bin | 1001010100000100001000… |
… | …1010100110110101001101 |
3 | 1100020222000221212022211012 |
4 | 2111001002022212311031 |
5 | 2320234124400013123 |
6 | 33440200123335005 |
7 | 2104560323521100 |
oct | 225010212466515 |
9 | 40228027768735 |
10 | 10240312110413 |
11 | 329898a249450 |
12 | 1194783981465 |
13 | 5938710a8068 |
14 | 2758c3024737 |
15 | 12b5924a1378 |
hex | 950422a6d4d |
10240312110413 has 48 divisors (see below), whose sum is σ = 13454858631168. Its totient is φ = 7698728268000.
The previous prime is 10240312110409. The next prime is 10240312110449. The reversal of 10240312110413 is 31401121304201.
It is not a de Polignac number, because 10240312110413 - 22 = 10240312110409 is a prime.
It is a super-2 number, since 2×102403121104132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10240312110463) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4604906 + ... + 6456452.
It is an arithmetic number, because the mean of its divisors is an integer number (280309554816).
Almost surely, 210240312110413 is an apocalyptic number.
It is an amenable number.
10240312110413 is a deficient number, since it is larger than the sum of its proper divisors (3214546520755).
10240312110413 is a wasteful number, since it uses less digits than its factorization.
10240312110413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1851934 (or 1851927 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 10240312110413 its reverse (31401121304201), we get a palindrome (41641433414614).
The spelling of 10240312110413 in words is "ten trillion, two hundred forty billion, three hundred twelve million, one hundred ten thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •