Base | Representation |
---|---|
bin | 111100111010101… |
… | …100101010000111 |
3 | 2122020010000012011 |
4 | 330322230222013 |
5 | 4043114121411 |
6 | 245225235051 |
7 | 34220012551 |
oct | 7472545207 |
9 | 2566100164 |
10 | 1022020231 |
11 | 4849a3a21 |
12 | 246332a87 |
13 | 133979ccb |
14 | 99a404d1 |
15 | 5ead0c21 |
hex | 3ceaca87 |
1022020231 has 4 divisors (see below), whose sum is σ = 1028530072. Its totient is φ = 1015510392.
The previous prime is 1022020201. The next prime is 1022020267. The reversal of 1022020231 is 1320202201.
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 1022020231 - 25 = 1022020199 is a prime.
It is a super-2 number, since 2×10220202312 = 2089050705146586722, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1022020201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3254685 + ... + 3254998.
It is an arithmetic number, because the mean of its divisors is an integer number (257132518).
Almost surely, 21022020231 is an apocalyptic number.
1022020231 is a deficient number, since it is larger than the sum of its proper divisors (6509841).
1022020231 is an equidigital number, since it uses as much as digits as its factorization.
1022020231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6509840.
The product of its (nonzero) digits is 48, while the sum is 13.
The square root of 1022020231 is about 31969.0511432542. The cubic root of 1022020231 is about 1007.2868498465.
Adding to 1022020231 its reverse (1320202201), we get a palindrome (2342222432).
The spelling of 1022020231 in words is "one billion, twenty-two million, twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •