Base | Representation |
---|---|
bin | 1001010111111010… |
… | …00110110001010111 |
3 | 110222201100201101020 |
4 | 10223331012301113 |
5 | 40301243443403 |
6 | 2151205532223 |
7 | 235464513624 |
oct | 45375066127 |
9 | 13881321336 |
10 | 5032406103 |
11 | 215273120a |
12 | b85414073 |
13 | 622796aba |
14 | 35a4d934b |
15 | 1e6c08453 |
hex | 12bf46c57 |
5032406103 has 8 divisors (see below), whose sum is σ = 6776309616. Its totient is φ = 3321720000.
The previous prime is 5032406059. The next prime is 5032406123. The reversal of 5032406103 is 3016042305.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5032406103 - 26 = 5032406039 is a prime.
It is a super-2 number, since 2×50324061032 = 50650222371023293218, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5032406123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8303998 + ... + 8304603.
It is an arithmetic number, because the mean of its divisors is an integer number (847038702).
Almost surely, 25032406103 is an apocalyptic number.
5032406103 is a deficient number, since it is larger than the sum of its proper divisors (1743903513).
5032406103 is a wasteful number, since it uses less digits than its factorization.
5032406103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16608705.
The product of its (nonzero) digits is 2160, while the sum is 24.
The square root of 5032406103 is about 70939.4537827858. The cubic root of 5032406103 is about 1713.6622379978.
Adding to 5032406103 its reverse (3016042305), we get a palindrome (8048448408).
The spelling of 5032406103 in words is "five billion, thirty-two million, four hundred six thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •