Base | Representation |
---|---|
bin | 1111000010011… |
… | …10011100111110 |
3 | 22210101002220100 |
4 | 13201032130332 |
5 | 224243303322 |
6 | 20303501530 |
7 | 3061155414 |
oct | 741163476 |
9 | 283332810 |
10 | 126150462 |
11 | 65232789 |
12 | 362b78a6 |
13 | 2019b559 |
14 | 12a7b2b4 |
15 | b11cdac |
hex | 784e73e |
126150462 has 48 divisors (see below), whose sum is σ = 288812160. Its totient is φ = 39684816.
The previous prime is 126150449. The next prime is 126150463. The reversal of 126150462 is 264051621.
126150462 is a `hidden beast` number, since 1 + 2 + 615 + 0 + 46 + 2 = 666.
It is a super-3 number, since 3×1261504623 (a number of 25 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126150463) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 118143 + ... + 119205.
It is an arithmetic number, because the mean of its divisors is an integer number (6016920).
Almost surely, 2126150462 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 126150462, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (144406080).
126150462 is an abundant number, since it is smaller than the sum of its proper divisors (162661698).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126150462 is a wasteful number, since it uses less digits than its factorization.
126150462 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1437 (or 1434 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
The square root of 126150462 is about 11231.6722708598. The cubic root of 126150462 is about 501.5292672481.
The spelling of 126150462 in words is "one hundred twenty-six million, one hundred fifty thousand, four hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •