Base | Representation |
---|---|
bin | 1010011101110001010000… |
… | …10111011111110010000111 |
3 | 10000111000212100022102021001 |
4 | 11032320220113133302013 |
5 | 11004021323134120403 |
6 | 120540024441434131 |
7 | 4563433240430602 |
oct | 516705027376207 |
9 | 100430770272231 |
10 | 23013112020103 |
11 | 737289586a567 |
12 | 26b811879b947 |
13 | cac1864772ca |
14 | 597baa71d339 |
15 | 29d9557a7c1d |
hex | 14ee285dfc87 |
23013112020103 has 4 divisors (see below), whose sum is σ = 23051919966768. Its totient is φ = 22974304073440.
The previous prime is 23013112020079. The next prime is 23013112020233. The reversal of 23013112020103 is 30102021131032.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23013112020103 is a prime.
It is a super-2 number, since 2×230131120201032 (a number of 28 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 (23013112090103) 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, 19403972443 + ... + 19403973628.
It is an arithmetic number, because the mean of its divisors is an integer number (5762979991692).
Almost surely, 223013112020103 is an apocalyptic number.
23013112020103 is a deficient number, since it is larger than the sum of its proper divisors (38807946665).
23013112020103 is an equidigital number, since it uses as much as digits as its factorization.
23013112020103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38807946664.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 23013112020103 its reverse (30102021131032), we get a palindrome (53115133151135).
The spelling of 23013112020103 in words is "twenty-three trillion, thirteen billion, one hundred twelve million, twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •