Base | Representation |
---|---|
bin | 11101100010101100000… |
… | …110101100110001100011 |
3 | 21012002001222212222222221 |
4 | 131202230012230301203 |
5 | 231230132133013443 |
6 | 4152342013411511 |
7 | 266446032201553 |
oct | 35425406546143 |
9 | 7162058788887 |
10 | 2030112001123 |
11 | 712a69332a28 |
12 | 289548499b97 |
13 | 119591bb260b |
14 | 70387b31163 |
15 | 37c1b87beed |
hex | 1d8ac1acc63 |
2030112001123 has 4 divisors (see below), whose sum is σ = 2050212120048. Its totient is φ = 2010011882200.
The previous prime is 2030112001097. The next prime is 2030112001139. The reversal of 2030112001123 is 3211002110302.
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 2030112001123 - 221 = 2030109903971 is a prime.
It is a super-2 number, since 2×20301120011232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2030112001097 and 2030112001106.
It is not an unprimeable number, because it can be changed into a prime (2030112071123) 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, 10050059311 + ... + 10050059512.
It is an arithmetic number, because the mean of its divisors is an integer number (512553030012).
Almost surely, 22030112001123 is an apocalyptic number.
2030112001123 is a deficient number, since it is larger than the sum of its proper divisors (20100118925).
2030112001123 is a wasteful number, since it uses less digits than its factorization.
2030112001123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20100118924.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 2030112001123 its reverse (3211002110302), we get a palindrome (5241114111425).
The spelling of 2030112001123 in words is "two trillion, thirty billion, one hundred twelve million, one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •