Base | Representation |
---|---|
bin | 11000100011101… |
… | …110110110010001 |
3 | 1001201021210100012 |
4 | 120203232312101 |
5 | 1320434120423 |
6 | 104515004305 |
7 | 13132053551 |
oct | 3043566621 |
9 | 1051253305 |
10 | 412020113 |
11 | 1a163589a |
12 | b5b99695 |
13 | 6748c7ab |
14 | 3ca13161 |
15 | 2628a078 |
hex | 188eed91 |
412020113 has 2 divisors, whose sum is σ = 412020114. Its totient is φ = 412020112.
The previous prime is 412020097. The next prime is 412020127. The reversal of 412020113 is 311020214.
It is an a-pointer prime, because the next prime (412020127) can be obtained adding 412020113 to its sum of digits (14).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 407555344 + 4464769 = 20188^2 + 2113^2 .
It is a cyclic number.
It is not a de Polignac number, because 412020113 - 24 = 412020097 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (412020913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 206010056 + 206010057.
It is an arithmetic number, because the mean of its divisors is an integer number (206010057).
Almost surely, 2412020113 is an apocalyptic number.
It is an amenable number.
412020113 is a deficient number, since it is larger than the sum of its proper divisors (1).
412020113 is an equidigital number, since it uses as much as digits as its factorization.
412020113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 412020113 is about 20298.2785723322. The cubic root of 412020113 is about 744.1139943890.
Adding to 412020113 its reverse (311020214), we get a palindrome (723040327).
It can be divided in two parts, 4120201 and 13, that added together give a palindrome (4120214).
The spelling of 412020113 in words is "four hundred twelve million, twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •