Base | Representation |
---|---|
bin | 111110100101101… |
… | …0000011101110111 |
3 | 12102100201021202202 |
4 | 1331023100131313 |
5 | 13300111244111 |
6 | 544220255115 |
7 | 103020403235 |
oct | 17513203567 |
9 | 5370637682 |
10 | 2100103031 |
11 | 9884a9544 |
12 | 4a73a149b |
13 | 276125a20 |
14 | 15ccb5955 |
15 | c4587b3b |
hex | 7d2d0777 |
2100103031 has 8 divisors (see below), whose sum is σ = 2265837504. Its totient is φ = 1934966880.
The previous prime is 2100103009. The next prime is 2100103037. The reversal of 2100103031 is 1303010012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2100103031 - 210 = 2100102007 is a prime.
It is a super-2 number, since 2×21001030312 = 8820865481630773922, 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 (2100103037) 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, 142271 + ... + 156336.
It is an arithmetic number, because the mean of its divisors is an integer number (283229688).
Almost surely, 22100103031 is an apocalyptic number.
2100103031 is a deficient number, since it is larger than the sum of its proper divisors (165734473).
2100103031 is a wasteful number, since it uses less digits than its factorization.
2100103031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 299161.
The product of its (nonzero) digits is 18, while the sum is 11.
The square root of 2100103031 is about 45826.8810961427. The cubic root of 2100103031 is about 1280.6001073993.
Adding to 2100103031 its reverse (1303010012), we get a palindrome (3403113043).
The spelling of 2100103031 in words is "two billion, one hundred million, one hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •