Base | Representation |
---|---|
bin | 11110100110101011010… |
… | …011110111100111100111 |
3 | 21110001111120101002100002 |
4 | 132212223103313213213 |
5 | 233424133424321411 |
6 | 4250053513011515 |
7 | 304642050364604 |
oct | 36465323674747 |
9 | 7401446332302 |
10 | 2103113120231 |
11 | 740a1a58a222 |
12 | 29b7203b3b9b |
13 | 123427013996 |
14 | 73b111616ab |
15 | 39a906a333b |
hex | 1e9ab4f79e7 |
2103113120231 has 8 divisors (see below), whose sum is σ = 2142853871184. Its totient is φ = 2063374568320.
The previous prime is 2103113120219. The next prime is 2103113120261. The reversal of 2103113120231 is 1320213113012.
It is a happy number.
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 2103113120231 - 230 = 2102039378407 is a prime.
It is a super-2 number, since 2×21031131202312 (a number of 25 digits) 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 (2103113120201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1449080 + ... + 2511186.
It is an arithmetic number, because the mean of its divisors is an integer number (267856733898).
Almost surely, 22103113120231 is an apocalyptic number.
2103113120231 is a deficient number, since it is larger than the sum of its proper divisors (39740750953).
2103113120231 is a wasteful number, since it uses less digits than its factorization.
2103113120231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1099521.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 2103113120231 its reverse (1320213113012), we get a palindrome (3423326233243).
The spelling of 2103113120231 in words is "two trillion, one hundred three billion, one hundred thirteen million, one hundred twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •