Base | Representation |
---|---|
bin | 1110100001011110110… |
… | …00010010010100110001 |
3 | 1202201000221102111012201 |
4 | 13100233120102110301 |
5 | 31133433320231001 |
6 | 1021124215423201 |
7 | 51023650244656 |
oct | 7205730222461 |
9 | 1681027374181 |
10 | 499011102001 |
11 | 1826a1837825 |
12 | 80865984b01 |
13 | 380972c9c29 |
14 | 1a21bb65c2d |
15 | cea8de6501 |
hex | 742f612531 |
499011102001 has 4 divisors (see below), whose sum is σ = 501895559412. Its totient is φ = 496126644592.
The previous prime is 499011101969. The next prime is 499011102053. The reversal of 499011102001 is 100201110994.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 100201110994 = 2 ⋅50100555497.
It can be written as a sum of positive squares in 2 ways, for example, as 326242022976 + 172769079025 = 571176^2 + 415655^2 .
It is a cyclic number.
It is not a de Polignac number, because 499011102001 - 25 = 499011101969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (499051102001) 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, 1442228446 + ... + 1442228791.
It is an arithmetic number, because the mean of its divisors is an integer number (125473889853).
Almost surely, 2499011102001 is an apocalyptic number.
It is an amenable number.
499011102001 is a deficient number, since it is larger than the sum of its proper divisors (2884457411).
499011102001 is a wasteful number, since it uses less digits than its factorization.
499011102001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2884457410.
The product of its (nonzero) digits is 648, while the sum is 28.
Adding to 499011102001 its reverse (100201110994), we get a palindrome (599212212995).
The spelling of 499011102001 in words is "four hundred ninety-nine billion, eleven million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •