Base | Representation |
---|---|
bin | 1001001000111111011000… |
… | …00010010010010000001011 |
3 | 2122011112220100212001001000 |
4 | 10210133230002102100023 |
5 | 10113310012133000021 |
6 | 110425510341430043 |
7 | 4143120341002011 |
oct | 444375402222013 |
9 | 78145810761030 |
10 | 20100112000011 |
11 | 644a45624042a |
12 | 2307652a0b323 |
13 | b2a581078c74 |
14 | 4d6bca1148b1 |
15 | 24ccb3d45b26 |
hex | 1247ec09240b |
20100112000011 has 16 divisors (see below), whose sum is σ = 29803373249920. Its totient is φ = 13388631370920.
The previous prime is 20100111999991. The next prime is 20100112000093. The reversal of 20100112000011 is 11000021100102.
It is a happy number.
It is not a de Polignac number, because 20100112000011 - 27 = 20100111999883 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20100111999957 and 20100112000002.
It is not an unprimeable number, because it can be changed into a prime (20100112007011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 317837125 + ... + 317900358.
It is an arithmetic number, because the mean of its divisors is an integer number (1862710828120).
Almost surely, 220100112000011 is an apocalyptic number.
20100112000011 is a deficient number, since it is larger than the sum of its proper divisors (9703261249909).
20100112000011 is a wasteful number, since it uses less digits than its factorization.
20100112000011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 635738663 (or 635738657 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 20100112000011 its reverse (11000021100102), we get a palindrome (31100133100113).
The spelling of 20100112000011 in words is "twenty trillion, one hundred billion, one hundred twelve million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •