Base | Representation |
---|---|
bin | 1001100110001000… |
… | …00100000000000000 |
3 | 111022000202222001200 |
4 | 10303010010000000 |
5 | 41022311422042 |
6 | 2211110101200 |
7 | 241443321600 |
oct | 46304040000 |
9 | 14260688050 |
10 | 5151670272 |
11 | 2203a90141 |
12 | bb934a800 |
13 | 6413c3b08 |
14 | 36c2a2c00 |
15 | 202415c4c |
hex | 133104000 |
5151670272 has 540 divisors, whose sum is σ = 18647306496. Its totient is φ = 1362493440.
The previous prime is 5151670261. The next prime is 5151670313. The reversal of 5151670272 is 2720761515.
5151670272 is a `hidden beast` number, since 5 + 1 + 516 + 70 + 2 + 72 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 166182897 + ... + 166182927.
Almost surely, 25151670272 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5151670272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9323653248).
5151670272 is an abundant number, since it is smaller than the sum of its proper divisors (13495636224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5151670272 is a wasteful number, since it uses less digits than its factorization.
5151670272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102 (or 66 counting only the distinct ones).
The product of its (nonzero) digits is 29400, while the sum is 36.
The square root of 5151670272 is about 71775.1368650733. The cubic root of 5151670272 is about 1727.0941754519.
The spelling of 5151670272 in words is "five billion, one hundred fifty-one million, six hundred seventy thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •