Base | Representation |
---|---|
bin | 100011100110011010101… |
… | …1110000001110011001111 |
3 | 122022202100011100210102222 |
4 | 1013030311132001303033 |
5 | 1120131041343024122 |
6 | 14223430121405555 |
7 | 1013332515465002 |
oct | 107146536016317 |
9 | 18282304323388 |
10 | 4892864814287 |
11 | 16170636a386a |
12 | 67032a6398bb |
13 | 29651a268958 |
14 | 12cb5cc59539 |
15 | 8741bdb7b42 |
hex | 47335781ccf |
4892864814287 has 4 divisors (see below), whose sum is σ = 5180680391616. Its totient is φ = 4605049236960.
The previous prime is 4892864814263. The next prime is 4892864814293. The reversal of 4892864814287 is 7824184682984.
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 4892864814287 - 28 = 4892864814031 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 4892864814287.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4892864810287) 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, 143907788639 + ... + 143907788672.
It is an arithmetic number, because the mean of its divisors is an integer number (1295170097904).
Almost surely, 24892864814287 is an apocalyptic number.
4892864814287 is a deficient number, since it is larger than the sum of its proper divisors (287815577329).
4892864814287 is a wasteful number, since it uses less digits than its factorization.
4892864814287 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 287815577328.
The product of its digits is 396361728, while the sum is 71.
The spelling of 4892864814287 in words is "four trillion, eight hundred ninety-two billion, eight hundred sixty-four million, eight hundred fourteen thousand, two hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •