Base | Representation |
---|---|
bin | 1001100001011100000011… |
… | …0100111101110010101010 |
3 | 1101001221002012122021121202 |
4 | 2120113000310331302222 |
5 | 2333020201011113120 |
6 | 34133514533204202 |
7 | 2130303051041162 |
oct | 230270064756252 |
9 | 41057065567552 |
10 | 10470070410410 |
11 | 3377371879906 |
12 | 1211205490662 |
13 | 5ac428694770 |
14 | 282a7b3d55a2 |
15 | 13253d209875 |
hex | 985c0d3dcaa |
10470070410410 has 64 divisors (see below), whose sum is σ = 22620738067200. Its totient is φ = 3446969582592.
The previous prime is 10470070410407. The next prime is 10470070410413. The reversal of 10470070410410 is 1401407007401.
It is an interprime number because it is at equal distance from previous prime (10470070410407) and next prime (10470070410413).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10470070410413) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 124631390 + ... + 124715369.
It is an arithmetic number, because the mean of its divisors is an integer number (353449032300).
Almost surely, 210470070410410 is an apocalyptic number.
10470070410410 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10470070410410 is an abundant number, since it is smaller than the sum of its proper divisors (12150667656790).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10470070410410 is a wasteful number, since it uses less digits than its factorization.
10470070410410 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 249346815.
The product of its (nonzero) digits is 3136, while the sum is 29.
Adding to 10470070410410 its reverse (1401407007401), we get a palindrome (11871477417811).
The spelling of 10470070410410 in words is "ten trillion, four hundred seventy billion, seventy million, four hundred ten thousand, four hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •