Base | Representation |
---|---|
bin | 100100001011011111110… |
… | …101000001100101110001 |
3 | 22210200102210002001012202 |
4 | 210023133311001211301 |
5 | 311213313024111101 |
6 | 5142055451032545 |
7 | 344424333666461 |
oct | 44133765014561 |
9 | 8720383061182 |
10 | 2486246316401 |
11 | 879458258221 |
12 | 341a26a3b755 |
13 | 1505b5126113 |
14 | 884991d7ba1 |
15 | 44a1643536b |
hex | 242dfd41971 |
2486246316401 has 4 divisors (see below), whose sum is σ = 2486786457072. Its totient is φ = 2485706175732.
The previous prime is 2486246316329. The next prime is 2486246316479. The reversal of 2486246316401 is 1046136426842.
It is a happy number.
2486246316401 is digitally balanced in base 2, 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 2486246316401 - 222 = 2486242122097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2486246316601) 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, 270063431 + ... + 270072636.
It is an arithmetic number, because the mean of its divisors is an integer number (621696614268).
Almost surely, 22486246316401 is an apocalyptic number.
It is an amenable number.
2486246316401 is a deficient number, since it is larger than the sum of its proper divisors (540140671).
2486246316401 is an equidigital number, since it uses as much as digits as its factorization.
2486246316401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 540140670.
The product of its (nonzero) digits is 1327104, while the sum is 47.
The spelling of 2486246316401 in words is "two trillion, four hundred eighty-six billion, two hundred forty-six million, three hundred sixteen thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •