Base | Representation |
---|---|
bin | 1010001011011100… |
… | …11110000100101000 |
3 | 112002211221102202011 |
4 | 11011232132010220 |
5 | 42142440331000 |
6 | 2302133045304 |
7 | 252264560314 |
oct | 50556360450 |
9 | 15084842664 |
10 | 5464777000 |
11 | 23547a6931 |
12 | 1086186834 |
13 | 691230577 |
14 | 39bac8b44 |
15 | 21eb632ba |
hex | 145b9e128 |
5464777000 has 128 divisors (see below), whose sum is σ = 13598357760. Its totient is φ = 2050963200.
The previous prime is 5464776983. The next prime is 5464777013. The reversal of 5464777000 is 7774645.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1216759 + ... + 1221241.
It is an arithmetic number, because the mean of its divisors is an integer number (106237170).
Almost surely, 25464777000 is an apocalyptic number.
5464777000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5464777000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6799178880).
5464777000 is an abundant number, since it is smaller than the sum of its proper divisors (8133580760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5464777000 is a wasteful number, since it uses less digits than its factorization.
5464777000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4580 (or 4566 counting only the distinct ones).
The product of its (nonzero) digits is 164640, while the sum is 40.
The square root of 5464777000 is about 73924.1300253172. The cubic root of 5464777000 is about 1761.3979294783.
The spelling of 5464777000 in words is "five billion, four hundred sixty-four million, seven hundred seventy-seven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •