Base | Representation |
---|---|
bin | 111001000100010111… |
… | …1100100100001111000 |
3 | 102201022221120110100120 |
4 | 1302020233210201320 |
5 | 4001442113143211 |
6 | 132144501333240 |
7 | 11565661326420 |
oct | 1621057444170 |
9 | 381287513316 |
10 | 122553256056 |
11 | 47a7a1331a0 |
12 | 1b902a07220 |
13 | b731171c7a |
14 | 5d0849b480 |
15 | 32c4200d06 |
hex | 1c88be4878 |
122553256056 has 64 divisors (see below), whose sum is σ = 381984180480. Its totient is φ = 31832014080.
The previous prime is 122553255991. The next prime is 122553256061. The reversal of 122553256056 is 650652355221.
122553256056 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 122553255999 and 122553256017.
It is a congruent number.
It is an unprimeable number.
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, 33156501 + ... + 33160196.
It is an arithmetic number, because the mean of its divisors is an integer number (5968502820).
Almost surely, 2122553256056 is an apocalyptic number.
It is an amenable number.
122553256056 is an abundant number, since it is smaller than the sum of its proper divisors (259430924424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122553256056 is a wasteful number, since it uses less digits than its factorization.
122553256056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66316724 (or 66316720 counting only the distinct ones).
The product of its (nonzero) digits is 540000, while the sum is 42.
The spelling of 122553256056 in words is "one hundred twenty-two billion, five hundred fifty-three million, two hundred fifty-six thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •