Base | Representation |
---|---|
bin | 11110101101000111100… |
… | …110000011011101101011 |
3 | 21110201100121220002020020 |
4 | 132231013212003131223 |
5 | 234032320201202311 |
6 | 4253200123531523 |
7 | 305305340632416 |
oct | 36550746033553 |
9 | 7421317802206 |
10 | 2110030100331 |
11 | 743949a8a7aa |
12 | 2a0b30989ba3 |
13 | 123c8a06cb0a |
14 | 741a9a6ab7d |
15 | 39d47a6dc06 |
hex | 1eb4798376b |
2110030100331 has 4 divisors (see below), whose sum is σ = 2813373467112. Its totient is φ = 1406686733552.
The previous prime is 2110030100281. The next prime is 2110030100341. The reversal of 2110030100331 is 1330010300112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2110030100331 - 213 = 2110030092139 is a prime.
It is a super-2 number, since 2×21100301003312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2110030100331.
It is not an unprimeable number, because it can be changed into a prime (2110030100341) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 351671683386 + ... + 351671683391.
It is an arithmetic number, because the mean of its divisors is an integer number (703343366778).
Almost surely, 22110030100331 is an apocalyptic number.
2110030100331 is a deficient number, since it is larger than the sum of its proper divisors (703343366781).
2110030100331 is an equidigital number, since it uses as much as digits as its factorization.
2110030100331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 703343366780.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 2110030100331 its reverse (1330010300112), we get a palindrome (3440040400443).
The spelling of 2110030100331 in words is "two trillion, one hundred ten billion, thirty million, one hundred thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •