Base | Representation |
---|---|
bin | 111100110011110… |
… | …001000101000011 |
3 | 2122002200200212120 |
4 | 330303301011003 |
5 | 4042133001311 |
6 | 245122255323 |
7 | 34165404510 |
oct | 7463610503 |
9 | 2562620776 |
10 | 1020203331 |
11 | 483972954 |
12 | 2457b7543 |
13 | 133492014 |
14 | 996ca307 |
15 | 5e872706 |
hex | 3ccf1143 |
1020203331 has 32 divisors (see below), whose sum is σ = 1619186688. Its totient is φ = 559198080.
The previous prime is 1020203329. The next prime is 1020203411. The reversal of 1020203331 is 1333020201.
1020203331 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1020203331 - 21 = 1020203329 is a prime.
It is a super-2 number, since 2×10202033312 = 2081629673166991122, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1020203331.
It is not an unprimeable number, because it can be changed into a prime (1020203311) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 45921 + ... + 64413.
It is an arithmetic number, because the mean of its divisors is an integer number (50599584).
Almost surely, 21020203331 is an apocalyptic number.
1020203331 is a deficient number, since it is larger than the sum of its proper divisors (598983357).
1020203331 is a wasteful number, since it uses less digits than its factorization.
1020203331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18611.
The product of its (nonzero) digits is 108, while the sum is 15.
The square root of 1020203331 is about 31940.6219570001. The cubic root of 1020203331 is about 1006.6895932213.
Adding to 1020203331 its reverse (1333020201), we get a palindrome (2353223532).
The spelling of 1020203331 in words is "one billion, twenty million, two hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •