Base | Representation |
---|---|
bin | 11101101100010001101… |
… | …01111110101111000011 |
3 | 10121112022201010022002121 |
4 | 32312020311332233003 |
5 | 113203333443213443 |
6 | 2100401433025111 |
7 | 133464404164333 |
oct | 16661065765703 |
9 | 3545281108077 |
10 | 1020203101123 |
11 | 363736065888 |
12 | 14587bb55197 |
13 | 75287a7514b |
14 | 375416bb0c3 |
15 | 1b8102504ed |
hex | ed88d7ebc3 |
1020203101123 has 4 divisors (see below), whose sum is σ = 1020448759768. Its totient is φ = 1019957442480.
The previous prime is 1020203101117. The next prime is 1020203101139. The reversal of 1020203101123 is 3211013020201.
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 1020203101123 - 29 = 1020203100611 is a prime.
It is a super-2 number, since 2×10202031011232 (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 = 1020203101097 and 1020203101106.
It is not an unprimeable number, because it can be changed into a prime (1020203102123) 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, 122823093 + ... + 122831398.
It is an arithmetic number, because the mean of its divisors is an integer number (255112189942).
Almost surely, 21020203101123 is an apocalyptic number.
1020203101123 is a deficient number, since it is larger than the sum of its proper divisors (245658645).
1020203101123 is an equidigital number, since it uses as much as digits as its factorization.
1020203101123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 245658644.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 1020203101123 its reverse (3211013020201), we get a palindrome (4231216121324).
The spelling of 1020203101123 in words is "one trillion, twenty billion, two hundred three million, one hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •