Base | Representation |
---|---|
bin | 11110100100110101000… |
… | …111101011011110110101 |
3 | 21102212101101011222101200 |
4 | 132210311013223132311 |
5 | 233411103313311201 |
6 | 4245125040243113 |
7 | 304541652064050 |
oct | 36446507533665 |
9 | 7385341158350 |
10 | 2101130213301 |
11 | 7400a2257969 |
12 | 29b268310499 |
13 | 12319c272882 |
14 | 739a3a75a97 |
15 | 399c656a386 |
hex | 1e9351eb7b5 |
2101130213301 has 48 divisors (see below), whose sum is σ = 3511659540480. Its totient is φ = 1185728245920.
The previous prime is 2101130213291. The next prime is 2101130213309. The reversal of 2101130213301 is 1033120311012.
2101130213301 is a `hidden beast` number, since 21 + 0 + 1 + 130 + 213 + 301 = 666.
It is not a de Polignac number, because 2101130213301 - 25 = 2101130213269 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2101130213309) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 13891440 + ... + 14041878.
It is an arithmetic number, because the mean of its divisors is an integer number (73159573760).
Almost surely, 22101130213301 is an apocalyptic number.
2101130213301 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2101130213301 is a deficient number, since it is larger than the sum of its proper divisors (1410529327179).
2101130213301 is a wasteful number, since it uses less digits than its factorization.
2101130213301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153206 (or 153203 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 2101130213301 its reverse (1033120311012), we get a palindrome (3134250524313).
The spelling of 2101130213301 in words is "two trillion, one hundred one billion, one hundred thirty million, two hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •