Base | Representation |
---|---|
bin | 1110100100010110010… |
… | …00011101000010011110 |
3 | 1202212000012222202011120 |
4 | 13102023020131002132 |
5 | 31200111404033304 |
6 | 1021541045231410 |
7 | 51110051445630 |
oct | 7221310350236 |
9 | 1685005882146 |
10 | 500550455454 |
11 | 183311756865 |
12 | 81015402566 |
13 | 382811ba66a |
14 | 1a326390a50 |
15 | d0491160d9 |
hex | 748b21d09e |
500550455454 has 64 divisors (see below), whose sum is σ = 1172629785600. Its totient is φ = 139453735680.
The previous prime is 500550455443. The next prime is 500550455459. The reversal of 500550455454 is 454554055005.
It is a super-2 number, since 2×5005504554542 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (500550455459) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3281607 + ... + 3430749.
It is an arithmetic number, because the mean of its divisors is an integer number (18322340400).
Almost surely, 2500550455454 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 500550455454, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (586314892800).
500550455454 is an abundant number, since it is smaller than the sum of its proper divisors (672079330146).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
500550455454 is a wasteful number, since it uses less digits than its factorization.
500550455454 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 151145.
The product of its (nonzero) digits is 1000000, while the sum is 42.
The spelling of 500550455454 in words is "five hundred billion, five hundred fifty million, four hundred fifty-five thousand, four hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •