Base | Representation |
---|---|
bin | 11101011100000011110… |
… | …10111111100011111111 |
3 | 10120200211222010120121001 |
4 | 32232001322333203333 |
5 | 113033021220241002 |
6 | 2052401511551131 |
7 | 133035560660320 |
oct | 16560172774377 |
9 | 3520758116531 |
10 | 1011497040127 |
11 | 35aa78789352 |
12 | 14405038b4a7 |
13 | 744cb17cc72 |
14 | 36d5733c447 |
15 | 1b4a0c86a87 |
hex | eb81ebf8ff |
1011497040127 has 6 divisors (see below), whose sum is σ = 1155999658344. Its totient is φ = 866995182180.
The previous prime is 1011497040119. The next prime is 1011497040143. The reversal of 1011497040127 is 7210407941101.
It is a happy number.
It is not a de Polignac number, because 1011497040127 - 23 = 1011497040119 is a prime.
It is a super-2 number, since 2×10114970401272 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011497040107) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2470852 + ... + 2850982.
It is an arithmetic number, because the mean of its divisors is an integer number (192666609724).
Almost surely, 21011497040127 is an apocalyptic number.
1011497040127 is a deficient number, since it is larger than the sum of its proper divisors (144502618217).
1011497040127 is an frugal number, since it uses more digits than its factorization.
1011497040127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 760269 (or 380138 counting only the distinct ones).
The product of its (nonzero) digits is 14112, while the sum is 37.
The spelling of 1011497040127 in words is "one trillion, eleven billion, four hundred ninety-seven million, forty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •