Base | Representation |
---|---|
bin | 11101101100011101101… |
… | …00010000000100010011 |
3 | 10121112120200200111101002 |
4 | 32312032310100010103 |
5 | 113204040121423443 |
6 | 2100415412532215 |
7 | 133500032022635 |
oct | 16661664200423 |
9 | 3545520614332 |
10 | 1020303311123 |
11 | 363787690068 |
12 | 1458a962106b |
13 | 752a27603c5 |
14 | 37550b24a55 |
15 | 1b818e472b8 |
hex | ed8ed10113 |
1020303311123 has 4 divisors (see below), whose sum is σ = 1020312130248. Its totient is φ = 1020294492000.
The previous prime is 1020303311077. The next prime is 1020303311191. The reversal of 1020303311123 is 3211133030201.
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 1020303311123 - 28 = 1020303310867 is a prime.
It is a super-2 number, since 2×10203033111232 (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 = 1020303311095 and 1020303311104.
It is not an unprimeable number, because it can be changed into a prime (1020303391123) 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, 4233686 + ... + 4468187.
It is an arithmetic number, because the mean of its divisors is an integer number (255078032562).
Almost surely, 21020303311123 is an apocalyptic number.
1020303311123 is a deficient number, since it is larger than the sum of its proper divisors (8819125).
1020303311123 is an equidigital number, since it uses as much as digits as its factorization.
1020303311123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8819124.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 1020303311123 its reverse (3211133030201), we get a palindrome (4231436341324).
The spelling of 1020303311123 in words is "one trillion, twenty billion, three hundred three million, three hundred eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •