Base | Representation |
---|---|
bin | 1011110111000001110010… |
… | …0100110000111010001100 |
3 | 1201011121112000202122222012 |
4 | 2331300130210300322030 |
5 | 3202121410012011340 |
6 | 43422254321440352 |
7 | 2514052234051466 |
oct | 275603444607214 |
9 | 51147460678865 |
10 | 13040000110220 |
11 | 4178262123626 |
12 | 15672a57a00b8 |
13 | 737888a78ba5 |
14 | 3311d4621136 |
15 | 179301191565 |
hex | bdc1c930e8c |
13040000110220 has 24 divisors (see below), whose sum is σ = 27384430071600. Its totient is φ = 5215918169792.
The previous prime is 13040000110201. The next prime is 13040000110243. The reversal of 13040000110220 is 2201100004031.
It is a super-2 number, since 2×130400001102202 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13040000110195 and 13040000110204.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3802910 + ... + 6367269.
It is an arithmetic number, because the mean of its divisors is an integer number (1141017919650).
Almost surely, 213040000110220 is an apocalyptic number.
13040000110220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13040000110220 is an abundant number, since it is smaller than the sum of its proper divisors (14344429961380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13040000110220 is a wasteful number, since it uses less digits than its factorization.
13040000110220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10234297 (or 10234295 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 13040000110220 its reverse (2201100004031), we get a palindrome (15241100114251).
The spelling of 13040000110220 in words is "thirteen trillion, forty billion, one hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •