Base | Representation |
---|---|
bin | 1010010110010110… |
… | …00100110111111000 |
3 | 112100012220021110021 |
4 | 11023023010313320 |
5 | 42334334141130 |
6 | 2315155500224 |
7 | 254454412102 |
oct | 51313046770 |
9 | 15305807407 |
10 | 5556162040 |
11 | 23a1343860 |
12 | 10b08b7674 |
13 | 6a7148a60 |
14 | 3a9cb6572 |
15 | 227bb537a |
hex | 14b2c4df8 |
5556162040 has 64 divisors (see below), whose sum is σ = 14686932960. Its totient is φ = 1865003520.
The previous prime is 5556161981. The next prime is 5556162041. The reversal of 5556162040 is 402616555.
It is a super-2 number, since 2×55561620402 = 61741873229473923200, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5556161987 and 5556162005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5556162041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 479959 + ... + 491398.
Almost surely, 25556162040 is an apocalyptic number.
It is an amenable number.
5556162040 is an abundant number, since it is smaller than the sum of its proper divisors (9130770920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5556162040 is a wasteful number, since it uses less digits than its factorization.
5556162040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 971392 (or 971388 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 34.
The square root of 5556162040 is about 74539.6675602997. The cubic root of 5556162040 is about 1771.1620615485.
Adding to 5556162040 its reverse (402616555), we get a palindrome (5958778595).
The spelling of 5556162040 in words is "five billion, five hundred fifty-six million, one hundred sixty-two thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •