Base | Representation |
---|---|
bin | 1100100001010… |
… | …00111110000100 |
3 | 21022121211210002 |
4 | 12100220332010 |
5 | 203341303122 |
6 | 14231020432 |
7 | 2413462352 |
oct | 620507604 |
9 | 238554702 |
10 | 105025412 |
11 | 54314168 |
12 | 2b20a718 |
13 | 189b301b |
14 | dd3c7d2 |
15 | 9348992 |
hex | 6428f84 |
105025412 has 12 divisors (see below), whose sum is σ = 184137996. Its totient is φ = 52414560.
The previous prime is 105025411. The next prime is 105025421. The reversal of 105025412 is 214520501.
It can be written as a sum of positive squares in 2 ways, for example, as 69789316 + 35236096 = 8354^2 + 5936^2 .
It is a super-2 number, since 2×1050254122 = 22060674331539488, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105025411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22103 + ... + 26430.
It is an arithmetic number, because the mean of its divisors is an integer number (15344833).
Almost surely, 2105025412 is an apocalyptic number.
It is an amenable number.
105025412 is a deficient number, since it is larger than the sum of its proper divisors (79112584).
105025412 is a wasteful number, since it uses less digits than its factorization.
105025412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49078 (or 49076 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 20.
The square root of 105025412 is about 10248.1906695768. The cubic root of 105025412 is about 471.8074540219.
Adding to 105025412 its reverse (214520501), we get a palindrome (319545913).
It can be divided in two parts, 1050 and 25412, that added together give a palindrome (26462).
The spelling of 105025412 in words is "one hundred five million, twenty-five thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •