Base | Representation |
---|---|
bin | 111110100111100… |
… | …1110110111000111 |
3 | 12102102200020010100 |
4 | 1331033032313013 |
5 | 13300343120111 |
6 | 544254455143 |
7 | 103032303156 |
oct | 17517166707 |
9 | 5372606110 |
10 | 2101145031 |
11 | 9890503a7 |
12 | 4a78044b3 |
13 | 2763cc0ab |
14 | 15d0a759d |
15 | c46e1756 |
hex | 7d3cedc7 |
2101145031 has 24 divisors (see below), whose sum is σ = 3062114640. Its totient is φ = 1388295936.
The previous prime is 2101145029. The next prime is 2101145041. The reversal of 2101145031 is 1305411012.
2101145031 is a `hidden beast` number, since 210 + 1 + 1 + 450 + 3 + 1 = 666.
It is not a de Polignac number, because 2101145031 - 21 = 2101145029 is a prime.
It is a super-2 number, since 2×21011450312 = 8829620882591981922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2101144995 and 2101145013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2101145021) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 538335 + ... + 542223.
It is an arithmetic number, because the mean of its divisors is an integer number (127588110).
Almost surely, 22101145031 is an apocalyptic number.
2101145031 is a deficient number, since it is larger than the sum of its proper divisors (960969609).
2101145031 is a wasteful number, since it uses less digits than its factorization.
2101145031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4415 (or 4412 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
The square root of 2101145031 is about 45838.2485594727. The cubic root of 2101145031 is about 1280.8118691812.
Adding to 2101145031 its reverse (1305411012), we get a palindrome (3406556043).
The spelling of 2101145031 in words is "two billion, one hundred one million, one hundred forty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •