Base | Representation |
---|---|
bin | 11110100100101111001… |
… | …010001010011100100011 |
3 | 21102212010101222211110221 |
4 | 132210233022022130203 |
5 | 233410402212413443 |
6 | 4245111104503511 |
7 | 304536326021260 |
oct | 36445712123443 |
9 | 7385111884427 |
10 | 2101030201123 |
11 | 740050858277 |
12 | 29b23a91ab97 |
13 | 123184626679 |
14 | 73994680267 |
15 | 399bc8b1eed |
hex | 1e92f28a723 |
2101030201123 has 8 divisors (see below), whose sum is σ = 2430107221248. Its totient is φ = 1779185643144.
The previous prime is 2101030201103. The next prime is 2101030201159. The reversal of 2101030201123 is 3211020301012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-2101030201123 is a prime.
It is a super-2 number, since 2×21010302011232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2101030201097 and 2101030201106.
It is not an unprimeable number, because it can be changed into a prime (2101030201103) 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, 1808114911 + ... + 1808116072.
It is an arithmetic number, because the mean of its divisors is an integer number (303763402656).
Almost surely, 22101030201123 is an apocalyptic number.
2101030201123 is a deficient number, since it is larger than the sum of its proper divisors (329077020125).
2101030201123 is an equidigital number, since it uses as much as digits as its factorization.
2101030201123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3616231073.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 2101030201123 its reverse (3211020301012), we get a palindrome (5312050502135).
The spelling of 2101030201123 in words is "two trillion, one hundred one billion, thirty million, two hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •