Base | Representation |
---|---|
bin | 1111001000100… |
… | …11001110110010 |
3 | 22211220001112100 |
4 | 13210103032302 |
5 | 230000101331 |
6 | 20333041230 |
7 | 3101053320 |
oct | 744231662 |
9 | 284801470 |
10 | 126956466 |
11 | 657332aa |
12 | 36626216 |
13 | 203c1390 |
14 | 12c0ad10 |
15 | b22bae6 |
hex | 79133b2 |
126956466 has 96 divisors (see below), whose sum is σ = 341228160. Its totient is φ = 33219072.
The previous prime is 126956443. The next prime is 126956471. The reversal of 126956466 is 664659621.
126956466 is a `hidden beast` number, since 1 + 26 + 9 + 564 + 66 = 666.
It is a super-2 number, since 2×1269564662 = 32235888518418312, which contains 22 as substring.
Its product of digits (466560) is a multiple of the sum of its prime factors (640).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 292986 + ... + 293418.
It is an arithmetic number, because the mean of its divisors is an integer number (3554460).
Almost surely, 2126956466 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 126956466, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (170614080).
126956466 is an abundant number, since it is smaller than the sum of its proper divisors (214271694).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126956466 is a wasteful number, since it uses less digits than its factorization.
126956466 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 640 (or 637 counting only the distinct ones).
The product of its digits is 466560, while the sum is 45.
The square root of 126956466 is about 11267.4959951180. The cubic root of 126956466 is about 502.5951286448.
The spelling of 126956466 in words is "one hundred twenty-six million, nine hundred fifty-six thousand, four hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •