Base | Representation |
---|---|
bin | 1001000110101101111000… |
… | …1101111101011011001100 |
3 | 1022110001010221102211001121 |
4 | 2101223132031331123030 |
5 | 2303010013003013400 |
6 | 33142554004050324 |
7 | 2052161650663252 |
oct | 221533615753314 |
9 | 38401127384047 |
10 | 10011002001100 |
11 | 320a707709311 |
12 | 11582483939a4 |
13 | 578058603949 |
14 | 26876c3a05d2 |
15 | 125620c7a21a |
hex | 91ade37d6cc |
10011002001100 has 36 divisors (see below), whose sum is σ = 21738425151744. Its totient is φ = 4001718623680.
The previous prime is 10011002001031. The next prime is 10011002001107. The reversal of 10011002001100 is 110020011001.
It is a super-2 number, since 2×100110020011002 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10011002001107) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 33377164 + ... + 33675763.
It is an arithmetic number, because the mean of its divisors is an integer number (603845143104).
Almost surely, 210011002001100 is an apocalyptic number.
10011002001100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10011002001100 is an abundant number, since it is smaller than the sum of its proper divisors (11727423150644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10011002001100 is a wasteful number, since it uses less digits than its factorization.
10011002001100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67054434 (or 67054427 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 10011002001100 its reverse (110020011001), we get a palindrome (10121022012101).
The spelling of 10011002001100 in words is "ten trillion, eleven billion, two million, one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •