Base | Representation |
---|---|
bin | 1001011101101010011010… |
… | …0000110011111100010010 |
3 | 1100211201122120211001100221 |
4 | 2113122212200303330102 |
5 | 2330434324312111010 |
6 | 34044030201503254 |
7 | 2122515444115555 |
oct | 227324640637422 |
9 | 40751576731327 |
10 | 10405204410130 |
11 | 3351905698812 |
12 | 1200721aa1b2a |
13 | 5a628ba94b8a |
14 | 27d8865a269c |
15 | 1309e36bddda |
hex | 976a6833f12 |
10405204410130 has 16 divisors (see below), whose sum is σ = 19164934635264. Its totient is φ = 4065289164720.
The previous prime is 10405204410127. The next prime is 10405204410137. The reversal of 10405204410130 is 3101440250401.
10405204410130 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 10405204410095 and 10405204410104.
It is not an unprimeable number, because it can be changed into a prime (10405204410137) 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, 12099074466 + ... + 12099075325.
It is an arithmetic number, because the mean of its divisors is an integer number (1197808414704).
Almost surely, 210405204410130 is an apocalyptic number.
10405204410130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10405204410130 is a deficient number, since it is larger than the sum of its proper divisors (8759730225134).
10405204410130 is a wasteful number, since it uses less digits than its factorization.
10405204410130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24198149841.
The product of its (nonzero) digits is 1920, while the sum is 25.
Adding to 10405204410130 its reverse (3101440250401), we get a palindrome (13506644660531).
The spelling of 10405204410130 in words is "ten trillion, four hundred five billion, two hundred four million, four hundred ten thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •