Base | Representation |
---|---|
bin | 100011001001101110111… |
… | …0001111111111111111111 |
3 | 122002212100002202220211112 |
4 | 1012103131301333333333 |
5 | 1113123412103101024 |
6 | 14135241352512235 |
7 | 1006022141245436 |
oct | 106233561777777 |
9 | 18085302686745 |
10 | 4831264112639 |
11 | 15a2a22705988 |
12 | 6603b86ab67b |
13 | 290780cbb533 |
14 | 129b9796c11d |
15 | 85a13d7800e |
hex | 464ddc7ffff |
4831264112639 has 8 divisors (see below), whose sum is σ = 4961876871168. Its totient is φ = 4700653356960.
The previous prime is 4831264112627. The next prime is 4831264112663. The reversal of 4831264112639 is 9362114621384.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4831264112639 is a prime.
It is a super-2 number, since 2×48312641126392 (a number of 26 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 (4831264112669) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5278469 + ... + 6125745.
It is an arithmetic number, because the mean of its divisors is an integer number (620234608896).
Almost surely, 24831264112639 is an apocalyptic number.
4831264112639 is a deficient number, since it is larger than the sum of its proper divisors (130612758529).
4831264112639 is a wasteful number, since it uses less digits than its factorization.
4831264112639 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1001425.
The product of its digits is 1492992, while the sum is 50.
The spelling of 4831264112639 in words is "four trillion, eight hundred thirty-one billion, two hundred sixty-four million, one hundred twelve thousand, six hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •