Base | Representation |
---|---|
bin | 11101101011111001110… |
… | …11111000110111000011 |
3 | 10121111210210012112111010 |
4 | 32311330323320313003 |
5 | 113202431322321311 |
6 | 2100325535052003 |
7 | 133456430123646 |
oct | 16657473706703 |
9 | 3544723175433 |
10 | 1020003323331 |
11 | 363643314873 |
12 | 145825071003 |
13 | 75255568035 |
14 | 37522d55a5d |
15 | 1b7ec93bda6 |
hex | ed7cef8dc3 |
1020003323331 has 4 divisors (see below), whose sum is σ = 1360004431112. Its totient is φ = 680002215552.
The previous prime is 1020003323309. The next prime is 1020003323369. The reversal of 1020003323331 is 1333233000201.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1020003323331 - 26 = 1020003323267 is a prime.
It is a super-2 number, since 2×10200033233312 (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 = 1020003323298 and 1020003323307.
It is not an unprimeable number, because it can be changed into a prime (1020003325331) 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, 170000553886 + ... + 170000553891.
It is an arithmetic number, because the mean of its divisors is an integer number (340001107778).
Almost surely, 21020003323331 is an apocalyptic number.
1020003323331 is a deficient number, since it is larger than the sum of its proper divisors (340001107781).
1020003323331 is an equidigital number, since it uses as much as digits as its factorization.
1020003323331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 340001107780.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 1020003323331 its reverse (1333233000201), we get a palindrome (2353236323532).
The spelling of 1020003323331 in words is "one trillion, twenty billion, three million, three hundred twenty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •