Base | Representation |
---|---|
bin | 1111000010000… |
… | …11010110111101 |
3 | 22210021210120100 |
4 | 13201003112331 |
5 | 224240330041 |
6 | 20302511313 |
7 | 3060606060 |
oct | 741032675 |
9 | 283253510 |
10 | 126105021 |
11 | 65201629 |
12 | 36295539 |
13 | 20183973 |
14 | 12a688d7 |
15 | b10e6b6 |
hex | 78435bd |
126105021 has 48 divisors (see below), whose sum is σ = 224789760. Its totient is φ = 66528000.
The previous prime is 126105013. The next prime is 126105029. The reversal of 126105021 is 120501621.
126105021 is a `hidden beast` number, since 1 + 2 + 610 + 50 + 2 + 1 = 666.
It is an interprime number because it is at equal distance from previous prime (126105013) and next prime (126105029).
It is not a de Polignac number, because 126105021 - 23 = 126105013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 126104985 and 126105003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126105029) 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, 40521 + ... + 43521.
It is an arithmetic number, because the mean of its divisors is an integer number (4683120).
Almost surely, 2126105021 is an apocalyptic number.
It is an amenable number.
126105021 is a deficient number, since it is larger than the sum of its proper divisors (98684739).
126105021 is a wasteful number, since it uses less digits than its factorization.
126105021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3066 (or 3063 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
The square root of 126105021 is about 11229.6491930959. The cubic root of 126105021 is about 501.4690409437.
Adding to 126105021 its reverse (120501621), we get a palindrome (246606642).
The spelling of 126105021 in words is "one hundred twenty-six million, one hundred five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •