Base | Representation |
---|---|
bin | 1001011100000000… |
… | …00110110100010000 |
3 | 111002002222102102221 |
4 | 10232000012310100 |
5 | 40334041402102 |
6 | 2154433550424 |
7 | 236362432405 |
oct | 45600066420 |
9 | 14062872387 |
10 | 5066747152 |
11 | 2170057145 |
12 | b94a15414 |
13 | 62992b94c |
14 | 360cb82ac |
15 | 1e9c3d637 |
hex | 12e006d10 |
5066747152 has 40 divisors (see below), whose sum is σ = 9887224320. Its totient is φ = 2515259520.
The previous prime is 5066747143. The next prime is 5066747177. The reversal of 5066747152 is 2517476605.
It is a super-2 number, since 2×50667471522 = 51343853404600222208, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5066747099 and 5066747108.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1994299 + ... + 1996837.
It is an arithmetic number, because the mean of its divisors is an integer number (247180608).
Almost surely, 25066747152 is an apocalyptic number.
It is an amenable number.
5066747152 is a deficient number, since it is larger than the sum of its proper divisors (4820477168).
5066747152 is a wasteful number, since it uses less digits than its factorization.
5066747152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3391 (or 3385 counting only the distinct ones).
The product of its (nonzero) digits is 352800, while the sum is 43.
The square root of 5066747152 is about 71181.0870386228. The cubic root of 5066747152 is about 1717.5514049592.
The spelling of 5066747152 in words is "five billion, sixty-six million, seven hundred forty-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •