Base | Representation |
---|---|
bin | 10000001011110110010… |
… | …10110111100101001000 |
3 | 1222011102202200020220202 |
4 | 20011323022313211020 |
5 | 33102412002242343 |
6 | 1103250550111332 |
7 | 55115050304540 |
oct | 10057312674510 |
9 | 1864382606822 |
10 | 556117227848 |
11 | 1a493674a356 |
12 | 8b94264b548 |
13 | 4059834c740 |
14 | 1ccb815a320 |
15 | e6ec569db8 |
hex | 817b2b7948 |
556117227848 has 64 divisors (see below), whose sum is σ = 1288341452160. Its totient is φ = 219146305536.
The previous prime is 556117227791. The next prime is 556117227889. The reversal of 556117227848 is 848722711655.
It is a happy number.
It is a super-2 number, since 2×5561172278482 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (56).
It is a junction number, because it is equal to n+sod(n) for n = 556117227793 and 556117227802.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1299086 + ... + 1673277.
It is an arithmetic number, because the mean of its divisors is an integer number (20130335190).
Almost surely, 2556117227848 is an apocalyptic number.
It is an amenable number.
556117227848 is an abundant number, since it is smaller than the sum of its proper divisors (732224224312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
556117227848 is a wasteful number, since it uses less digits than its factorization.
556117227848 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2972646 (or 2972642 counting only the distinct ones).
The product of its digits is 7526400, while the sum is 56.
The spelling of 556117227848 in words is "five hundred fifty-six billion, one hundred seventeen million, two hundred twenty-seven thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •