Base | Representation |
---|---|
bin | 11101100010100110000… |
… | …001101001010111000011 |
3 | 21012001210212222110202121 |
4 | 131202212001221113003 |
5 | 231224430030404443 |
6 | 4152323531425111 |
7 | 266443353256501 |
oct | 35424601512703 |
9 | 7161725873677 |
10 | 2030010013123 |
11 | 712a16803924 |
12 | 28951a2b5197 |
13 | 119576a23ca1 |
14 | 70378383671 |
15 | 37c129334ed |
hex | 1d8a60695c3 |
2030010013123 has 4 divisors (see below), whose sum is σ = 2030126973280. Its totient is φ = 2029893052968.
The previous prime is 2030010013103. The next prime is 2030010013151. The reversal of 2030010013123 is 3213100100302.
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 2030010013123 - 229 = 2029473142211 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2030010013097 and 2030010013106.
It is not an unprimeable number, because it can be changed into a prime (2030010013103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 58454040 + ... + 58488757.
It is an arithmetic number, because the mean of its divisors is an integer number (507531743320).
Almost surely, 22030010013123 is an apocalyptic number.
2030010013123 is a deficient number, since it is larger than the sum of its proper divisors (116960157).
2030010013123 is a wasteful number, since it uses less digits than its factorization.
2030010013123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116960156.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 2030010013123 its reverse (3213100100302), we get a palindrome (5243110113425).
The spelling of 2030010013123 in words is "two trillion, thirty billion, ten million, thirteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •