Base | Representation |
---|---|
bin | 10000000001000001001… |
… | …010111011000001011010 |
3 | 10220012212001111110102220 |
4 | 100001001022323001122 |
5 | 121013014340310020 |
6 | 2201335545004510 |
7 | 142342006141062 |
oct | 20010112730132 |
9 | 3805761443386 |
10 | 1100605010010 |
11 | 394844920a70 |
12 | 15937a483736 |
13 | 7ca2c23936c |
14 | 3b3ab9963a2 |
15 | 1d968b5d240 |
hex | 100412bb05a |
1100605010010 has 64 divisors (see below), whose sum is σ = 2882028366720. Its totient is φ = 266772193280.
The previous prime is 1100605009993. The next prime is 1100605010023. The reversal of 1100605010010 is 100105060011.
It is a super-2 number, since 2×11006050100102 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1913914 + ... + 2421626.
It is an arithmetic number, because the mean of its divisors is an integer number (45031693230).
Almost surely, 21100605010010 is an apocalyptic number.
1100605010010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1100605010010 is an abundant number, since it is smaller than the sum of its proper divisors (1781423356710).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100605010010 is a wasteful number, since it uses less digits than its factorization.
1100605010010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 514303.
The product of its (nonzero) digits is 30, while the sum is 15.
The spelling of 1100605010010 in words is "one trillion, one hundred billion, six hundred five million, ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •