Base | Representation |
---|---|
bin | 100111111110110000101… |
… | …110110001001000000001 |
3 | 100201122122110021220201001 |
4 | 213332300232301020001 |
5 | 330003233440331001 |
6 | 5502054414212001 |
7 | 402332231316511 |
oct | 47766056611001 |
9 | 10648573256631 |
10 | 2747449152001 |
11 | 96a206469694 |
12 | 3845831b4001 |
13 | 16c11114a4c8 |
14 | 96d977d9841 |
15 | 4b702a08001 |
hex | 27fb0bb1201 |
2747449152001 has 4 divisors (see below), whose sum is σ = 2749577309104. Its totient is φ = 2745320994900.
The previous prime is 2747449151989. The next prime is 2747449152029. The reversal of 2747449152001 is 1002519447472.
It is a happy number.
2747449152001 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2747449152001 - 217 = 2747449020929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2747449152401) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1064076615 + ... + 1064079196.
It is an arithmetic number, because the mean of its divisors is an integer number (687394327276).
Almost surely, 22747449152001 is an apocalyptic number.
It is an amenable number.
2747449152001 is a deficient number, since it is larger than the sum of its proper divisors (2128157103).
2747449152001 is a wasteful number, since it uses less digits than its factorization.
2747449152001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2128157102.
The product of its (nonzero) digits is 564480, while the sum is 46.
The spelling of 2747449152001 in words is "two trillion, seven hundred forty-seven billion, four hundred forty-nine million, one hundred fifty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •