Base | Representation |
---|---|
bin | 1010011000001001100111… |
… | …0001110001101111100110 |
3 | 1111101210020102122021122221 |
4 | 2212002121301301233212 |
5 | 2443420201323213110 |
6 | 40133404311142554 |
7 | 2255226522062605 |
oct | 246023161615746 |
9 | 44353212567587 |
10 | 11410013101030 |
11 | 36a9a60a34315 |
12 | 1343406374a5a |
13 | 649c62388a3b |
14 | 2b636750ba3c |
15 | 14bc0219c7da |
hex | a6099c71be6 |
11410013101030 has 16 divisors (see below), whose sum is σ = 20543701839840. Its totient is φ = 4562743405312.
The previous prime is 11410013101007. The next prime is 11410013101031. The reversal of 11410013101030 is 3010131001411.
11410013101030 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 = 11410013100995 and 11410013101013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11410013101031) 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, 157691410 + ... + 157763749.
It is an arithmetic number, because the mean of its divisors is an integer number (1283981364990).
Almost surely, 211410013101030 is an apocalyptic number.
11410013101030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11410013101030 is a deficient number, since it is larger than the sum of its proper divisors (9133688738810).
11410013101030 is a wasteful number, since it uses less digits than its factorization.
11410013101030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 315458783.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 11410013101030 its reverse (3010131001411), we get a palindrome (14420144102441).
The spelling of 11410013101030 in words is "eleven trillion, four hundred ten billion, thirteen million, one hundred one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •