Base | Representation |
---|---|
bin | 111100110011000… |
… | …010110111010001 |
3 | 2122002100002012112 |
4 | 330303002313101 |
5 | 4042110422113 |
6 | 245114235105 |
7 | 34163655563 |
oct | 7463026721 |
9 | 2562302175 |
10 | 1020014033 |
11 | 483853705 |
12 | 245725a95 |
13 | 133426acc |
14 | 9967b333 |
15 | 5e8365a8 |
hex | 3ccc2dd1 |
1020014033 has 4 divisors (see below), whose sum is σ = 1020104688. Its totient is φ = 1019923380.
The previous prime is 1020014003. The next prime is 1020014041. The reversal of 1020014033 is 3304100201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 1020014033 - 28 = 1020013777 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1020013999 and 1020014017.
It is not an unprimeable number, because it can be changed into a prime (1020014003) 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, 25583 + ... + 51908.
It is an arithmetic number, because the mean of its divisors is an integer number (255026172).
Almost surely, 21020014033 is an apocalyptic number.
It is an amenable number.
1020014033 is a deficient number, since it is larger than the sum of its proper divisors (90655).
1020014033 is an equidigital number, since it uses as much as digits as its factorization.
1020014033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90654.
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 1020014033 is about 31937.6585397239. The cubic root of 1020014033 is about 1006.6273258581.
Adding to 1020014033 its reverse (3304100201), we get a palindrome (4324114234).
The spelling of 1020014033 in words is "one billion, twenty million, fourteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •