Base | Representation |
---|---|
bin | 10100110000111111111… |
… | …010001101011010000111 |
3 | 12001102100011211022112001 |
4 | 110300333322031122013 |
5 | 141334444322204101 |
6 | 3011315543410131 |
7 | 205045265323114 |
oct | 24607772153207 |
9 | 5042304738461 |
10 | 1427001366151 |
11 | 500208084329 |
12 | 1b068ba53947 |
13 | a47479754ca |
14 | 4d0d26c590b |
15 | 271bd8b4901 |
hex | 14c3fe8d687 |
1427001366151 has 4 divisors (see below), whose sum is σ = 1448299894072. Its totient is φ = 1405702838232.
The previous prime is 1427001366137. The next prime is 1427001366163. The reversal of 1427001366151 is 1516631007241.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1427001366151 - 213 = 1427001357959 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1427001366151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1427001366251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10649263860 + ... + 10649263993.
It is an arithmetic number, because the mean of its divisors is an integer number (362074973518).
Almost surely, 21427001366151 is an apocalyptic number.
1427001366151 is a deficient number, since it is larger than the sum of its proper divisors (21298527921).
1427001366151 is an equidigital number, since it uses as much as digits as its factorization.
1427001366151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21298527920.
The product of its (nonzero) digits is 30240, while the sum is 37.
The spelling of 1427001366151 in words is "one trillion, four hundred twenty-seven billion, one million, three hundred sixty-six thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •