Base | Representation |
---|---|
bin | 1111000001101… |
… | …00110011011101 |
3 | 22210011202210100 |
4 | 13200310303131 |
5 | 224231423110 |
6 | 20301331313 |
7 | 3060240213 |
oct | 740646335 |
9 | 283152710 |
10 | 126045405 |
11 | 65170862 |
12 | 36266b39 |
13 | 201627a5 |
14 | 12a50cb3 |
15 | b0ebbc0 |
hex | 7834cdd |
126045405 has 48 divisors (see below), whose sum is σ = 229522176. Its totient is φ = 63866880.
The previous prime is 126045391. The next prime is 126045407. The reversal of 126045405 is 504540621.
126045405 is a `hidden beast` number, since 1 + 2 + 604 + 54 + 0 + 5 = 666.
It is not a de Polignac number, because 126045405 - 28 = 126045149 is a prime.
It is a super-2 number, since 2×1260454052 = 31774888243228050, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126045407) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 199440 + ... + 200070.
It is an arithmetic number, because the mean of its divisors is an integer number (4781712).
Almost surely, 2126045405 is an apocalyptic number.
126045405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
126045405 is a deficient number, since it is larger than the sum of its proper divisors (103476771).
126045405 is a wasteful number, since it uses less digits than its factorization.
126045405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 858 (or 855 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
The square root of 126045405 is about 11226.9944775973. The cubic root of 126045405 is about 501.3900055218.
It can be divided in two parts, 1260 and 45405, that added together give a triangular number (46665 = T305).
The spelling of 126045405 in words is "one hundred twenty-six million, forty-five thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •