Base | Representation |
---|---|
bin | 111110100111100… |
… | …1011011100001101 |
3 | 12102102122111220110 |
4 | 1331033023130031 |
5 | 13300342143041 |
6 | 544254310233 |
7 | 103032214263 |
oct | 17517133415 |
9 | 5372574813 |
10 | 2101131021 |
11 | 989040920 |
12 | 4a77b8379 |
13 | 2763c58c2 |
14 | 15d0a2433 |
15 | c46dc516 |
hex | 7d3cb70d |
2101131021 has 16 divisors (see below), whose sum is σ = 3067481088. Its totient is φ = 1268708400.
The previous prime is 2101130987. The next prime is 2101131023. The reversal of 2101131021 is 1201311012.
It is not a de Polignac number, because 2101131021 - 29 = 2101130509 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2101130988 and 2101131006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2101131023) 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 15 ways as a sum of consecutive naturals, for example, 108531 + ... + 126416.
It is an arithmetic number, because the mean of its divisors is an integer number (191717568).
Almost surely, 22101131021 is an apocalyptic number.
It is an amenable number.
2101131021 is a deficient number, since it is larger than the sum of its proper divisors (966350067).
2101131021 is a wasteful number, since it uses less digits than its factorization.
2101131021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 235232.
The product of its (nonzero) digits is 12, while the sum is 12.
The square root of 2101131021 is about 45838.0957392429. The cubic root of 2101131021 is about 1280.8090224455.
Adding to 2101131021 its reverse (1201311012), we get a palindrome (3302442033).
Subtracting from 2101131021 its reverse (1201311012), we obtain a square (899820009 = 299972).
The spelling of 2101131021 in words is "two billion, one hundred one million, one hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •