Base | Representation |
---|---|
bin | 1001100101011000… |
… | …01100110101011000 |
3 | 111021121000011102221 |
4 | 10302230030311120 |
5 | 41014211240000 |
6 | 2210324033424 |
7 | 241336206625 |
oct | 46254146530 |
9 | 14247004387 |
10 | 5145415000 |
11 | 22004a84a0 |
12 | bb7232874 |
13 | 64001387b |
14 | 36b51534c |
15 | 201acc61a |
hex | 132b0cd58 |
5145415000 has 80 divisors (see below), whose sum is σ = 13151821320. Its totient is φ = 1871040000.
The previous prime is 5145414997. The next prime is 5145415039. The reversal of 5145415000 is 5145415.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 8224 + ... + 101776.
Almost surely, 25145415000 is an apocalyptic number.
5145415000 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 5145415000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6575910660).
5145415000 is an abundant number, since it is smaller than the sum of its proper divisors (8006406320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5145415000 is a wasteful number, since it uses less digits than its factorization.
5145415000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93590 (or 93571 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 25.
The square root of 5145415000 is about 71731.5481500295. The cubic root of 5145415000 is about 1726.3948670197.
5145415000 divided by its reverse (5145415) gives a cube (1000 = 103).
The spelling of 5145415000 in words is "five billion, one hundred forty-five million, four hundred fifteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.315 sec. • engine limits •