Base | Representation |
---|---|
bin | 11001000001011001010100… |
… | …100010100100110000010101 |
3 | 112102122101201112211020121110 |
4 | 121001121110202210300111 |
5 | 103411002400011021301 |
6 | 1030014532022005233 |
7 | 32115431664422100 |
oct | 3101312442446025 |
9 | 472571645736543 |
10 | 110047070407701 |
11 | 32078778362189 |
12 | 10413a39276819 |
13 | 495351810bbcb |
14 | 1d26441555737 |
15 | cac89bcc00d6 |
hex | 6416548a4c15 |
110047070407701 has 24 divisors (see below), whose sum is σ = 170687408716800. Its totient is φ = 62883245675712.
The previous prime is 110047070407693. The next prime is 110047070407717. The reversal of 110047070407701 is 107704070740011.
It is not a de Polignac number, because 110047070407701 - 23 = 110047070407693 is a prime.
It is a super-2 number, since 2×1100470704077012 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 110047070407701.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110047070407741) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7043500 + ... + 16422698.
It is an arithmetic number, because the mean of its divisors is an integer number (7111975363200).
Almost surely, 2110047070407701 is an apocalyptic number.
It is an amenable number.
110047070407701 is a deficient number, since it is larger than the sum of its proper divisors (60640338309099).
110047070407701 is an equidigital number, since it uses as much as digits as its factorization.
110047070407701 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9459033 (or 9459026 counting only the distinct ones).
The product of its (nonzero) digits is 38416, while the sum is 39.
The spelling of 110047070407701 in words is "one hundred ten trillion, forty-seven billion, seventy million, four hundred seven thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •