Base | Representation |
---|---|
bin | 11000100111110… |
… | …110100001011111 |
3 | 1001210022122211201 |
4 | 120213312201133 |
5 | 1321223201002 |
6 | 104554100331 |
7 | 13144202356 |
oct | 3047664137 |
9 | 1053278751 |
10 | 413100127 |
11 | 1a2203270 |
12 | b641a6a7 |
13 | 6777a25b |
14 | 3cc1499d |
15 | 26400087 |
hex | 189f685f |
413100127 has 8 divisors (see below), whose sum is σ = 453526992. Its totient is φ = 373152000.
The previous prime is 413100059. The next prime is 413100131. The reversal of 413100127 is 721001314.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-413100127 is a prime.
It is a super-2 number, since 2×4131001272 = 341303429854832258, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (413100137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 117874 + ... + 121327.
It is an arithmetic number, because the mean of its divisors is an integer number (56690874).
Almost surely, 2413100127 is an apocalyptic number.
413100127 is a deficient number, since it is larger than the sum of its proper divisors (40426865).
413100127 is a wasteful number, since it uses less digits than its factorization.
413100127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 239369.
The product of its (nonzero) digits is 168, while the sum is 19.
The square root of 413100127 is about 20324.8647473975. The cubic root of 413100127 is about 744.7636005050.
It can be divided in two parts, 4 and 13100127, that added together give a palindrome (13100131).
The spelling of 413100127 in words is "four hundred thirteen million, one hundred thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •