Base | Representation |
---|---|
bin | 10110111111001100110100… |
… | …001101011010001101100001 |
3 | 111020222002001120110022200000 |
4 | 112333030310031122031201 |
5 | 101222411011421023014 |
6 | 555004425545450213 |
7 | 30203146000246503 |
oct | 2677146415321541 |
9 | 436862046408600 |
10 | 101100111111009 |
11 | 2a23935305854a |
12 | b409a667a0969 |
13 | 4454912c5517a |
14 | 1ad73b2d5dd73 |
15 | ba4ca4dbc509 |
hex | 5bf33435a361 |
101100111111009 has 12 divisors (see below), whose sum is σ = 151442141746896. Its totient is φ = 67400074073844.
The previous prime is 101100111110953. The next prime is 101100111111011. The reversal of 101100111111009 is 900111111001101.
It is not a de Polignac number, because 101100111111009 - 27 = 101100111110881 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101100111110982 and 101100111111000.
It is not an unprimeable number, because it can be changed into a prime (101100111113009) 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, 208024919739 + ... + 208024920224.
It is an arithmetic number, because the mean of its divisors is an integer number (12620178478908).
Almost surely, 2101100111111009 is an apocalyptic number.
It is an amenable number.
101100111111009 is a deficient number, since it is larger than the sum of its proper divisors (50342030635887).
101100111111009 is an frugal number, since it uses more digits than its factorization.
101100111111009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 416049839978 (or 416049839966 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 18.
The spelling of 101100111111009 in words is "one hundred one trillion, one hundred billion, one hundred eleven million, one hundred eleven thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •