Base | Representation |
---|---|
bin | 1001100001110111… |
… | …11000001001000000 |
3 | 111012112121012122112 |
4 | 10300323320021000 |
5 | 40434142020422 |
6 | 2203352554452 |
7 | 240531012521 |
oct | 46073701100 |
9 | 14175535575 |
10 | 5115970112 |
11 | 2195917080 |
12 | ba93b2a28 |
13 | 636ba4466 |
14 | 36764c848 |
15 | 1ee212ee2 |
hex | 130ef8240 |
5115970112 has 56 divisors (see below), whose sum is σ = 11087599872. Its totient is φ = 2322777600.
The previous prime is 5115970103. The next prime is 5115970141. The reversal of 5115970112 is 2110795115.
It is a happy number.
It is a super-3 number, since 3×51159701123 (a number of 30 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 693998 + ... + 701330.
Almost surely, 25115970112 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 5115970112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5543799936).
5115970112 is an abundant number, since it is smaller than the sum of its proper divisors (5971629760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5115970112 is a wasteful number, since it uses less digits than its factorization.
5115970112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8347 (or 8337 counting only the distinct ones).
The product of its (nonzero) digits is 3150, while the sum is 32.
The square root of 5115970112 is about 71526.0100383070. The cubic root of 5115970112 is about 1723.0954390377.
The spelling of 5115970112 in words is "five billion, one hundred fifteen million, nine hundred seventy thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •