Base | Representation |
---|---|
bin | 10111010010001010000… |
… | …11111111010000000111 |
3 | 2211110222221122110021202 |
4 | 23221011003333100013 |
5 | 101101421240343341 |
6 | 1411305244333115 |
7 | 111541206550316 |
oct | 13510503772007 |
9 | 2743887573252 |
10 | 800022590471 |
11 | 289318994305 |
12 | 10b071b4419b |
13 | 5a598858c10 |
14 | 2aa1536627d |
15 | 15c252a579b |
hex | ba450ff407 |
800022590471 has 4 divisors (see below), whose sum is σ = 861562789752. Its totient is φ = 738482391192.
The previous prime is 800022590461. The next prime is 800022590483. The reversal of 800022590471 is 174095220008.
800022590471 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.
It is a de Polignac number, because none of the positive numbers 2k-800022590471 is a prime.
It is a super-3 number, since 3×8000225904713 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (800022590431) 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, 30770099621 + ... + 30770099646.
It is an arithmetic number, because the mean of its divisors is an integer number (215390697438).
Almost surely, 2800022590471 is an apocalyptic number.
800022590471 is a deficient number, since it is larger than the sum of its proper divisors (61540199281).
800022590471 is a wasteful number, since it uses less digits than its factorization.
800022590471 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61540199280.
The product of its (nonzero) digits is 40320, while the sum is 38.
The spelling of 800022590471 in words is "eight hundred billion, twenty-two million, five hundred ninety thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •