Base | Representation |
---|---|
bin | 1001100001010100… |
… | …10101001011000100 |
3 | 111012012221112002011 |
4 | 10300222111023010 |
5 | 40432002323221 |
6 | 2203110224004 |
7 | 240443634424 |
oct | 46052251304 |
9 | 14165845064 |
10 | 5111370436 |
11 | 2193265297 |
12 | ba7955004 |
13 | 635c53963 |
14 | 366bb2484 |
15 | 1edb051e1 |
hex | 130a952c4 |
5111370436 has 12 divisors (see below), whose sum is σ = 8952871312. Its totient is φ = 2553407208.
The previous prime is 5111370409. The next prime is 5111370487. The reversal of 5111370436 is 6340731115.
It is a super-2 number, since 2×51113704362 = 52252215468029660192, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5111370398 and 5111370407.
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 3 ways as a sum of consecutive naturals, for example, 564450 + ... + 573433.
Almost surely, 25111370436 is an apocalyptic number.
It is an amenable number.
5111370436 is a deficient number, since it is larger than the sum of its proper divisors (3841500876).
5111370436 is a wasteful number, since it uses less digits than its factorization.
5111370436 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1139010 (or 1139008 counting only the distinct ones).
The product of its (nonzero) digits is 7560, while the sum is 31.
The square root of 5111370436 is about 71493.8489382129. The cubic root of 5111370436 is about 1722.5788829054.
The spelling of 5111370436 in words is "five billion, one hundred eleven million, three hundred seventy thousand, four hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •