Base | Representation |
---|---|
bin | 10111011011000000011110… |
… | …110001111001001110100011 |
3 | 111111201202102112122112201001 |
4 | 113123000132301321032203 |
5 | 102000213023034220303 |
6 | 1003030334452052431 |
7 | 30461204623066264 |
oct | 2733003661711643 |
9 | 444652375575631 |
10 | 103011012023203 |
11 | 2a9057a7882979 |
12 | b678283604117 |
13 | 4562b8721cbbb |
14 | 1b61a8c42896b |
15 | bd9845b7a31d |
hex | 5db01ec793a3 |
103011012023203 has 4 divisors (see below), whose sum is σ = 105523475731128. Its totient is φ = 100498548315280.
The previous prime is 103011012023191. The next prime is 103011012023207. The reversal of 103011012023203 is 302320210110301.
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 103011012023203 - 221 = 103011009926051 is a prime.
It is a super-2 number, since 2×1030110120232032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103011012023207) 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, 1256231853901 + ... + 1256231853982.
It is an arithmetic number, because the mean of its divisors is an integer number (26380868932782).
Almost surely, 2103011012023203 is an apocalyptic number.
103011012023203 is a deficient number, since it is larger than the sum of its proper divisors (2512463707925).
103011012023203 is an equidigital number, since it uses as much as digits as its factorization.
103011012023203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2512463707924.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 103011012023203 its reverse (302320210110301), we get a palindrome (405331222133504).
The spelling of 103011012023203 in words is "one hundred three trillion, eleven billion, twelve million, twenty-three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •