Base | Representation |
---|---|
bin | 1110101101111… |
… | …00100010110100 |
3 | 22121022012100011 |
4 | 13112330202310 |
5 | 223101040133 |
6 | 20130030004 |
7 | 3026233030 |
oct | 726744264 |
9 | 277265304 |
10 | 123455668 |
11 | 63762086 |
12 | 35418304 |
13 | 1c766abb |
14 | 125791c0 |
15 | ac896cd |
hex | 75bc8b4 |
123455668 has 24 divisors (see below), whose sum is σ = 255427200. Its totient is φ = 51084768.
The previous prime is 123455627. The next prime is 123455669. The reversal of 123455668 is 866554321.
It is a super-2 number, since 2×1234556682 = 30482603922652448, which contains 22 as substring.
It is a hoax number, since the sum of its digits (40) coincides with the sum of the digits of its distinct prime factors.
It is a plaindrome in base 10.
It is a self number, because there is not a number n which added to its sum of digits gives 123455668.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123455669) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 75208 + ... + 76831.
It is an arithmetic number, because the mean of its divisors is an integer number (10642800).
Almost surely, 2123455668 is an apocalyptic number.
It is an amenable number.
123455668 is an abundant number, since it is smaller than the sum of its proper divisors (131971532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123455668 is a wasteful number, since it uses less digits than its factorization.
123455668 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152079 (or 152077 counting only the distinct ones).
The product of its digits is 172800, while the sum is 40.
The square root of 123455668 is about 11111.0606154408. The cubic root of 123455668 is about 497.9323521172.
The spelling of 123455668 in words is "one hundred twenty-three million, four hundred fifty-five thousand, six hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •