Base | Representation |
---|---|
bin | 111100110011110… |
… | …101001001111111 |
3 | 2122002201112210002 |
4 | 330303311021333 |
5 | 4042134020111 |
6 | 245122504515 |
7 | 34165504265 |
oct | 7463651177 |
9 | 2562645702 |
10 | 1020220031 |
11 | 483984456 |
12 | 24580513b |
13 | 1334997bc |
14 | 996d2435 |
15 | 5e87763b |
hex | 3ccf527f |
1020220031 has 8 divisors (see below), whose sum is σ = 1080515664. Its totient is φ = 959955840.
The previous prime is 1020220001. The next prime is 1020220043. The reversal of 1020220031 is 1300220201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1020220031 - 214 = 1020203647 is a prime.
It is a super-2 number, since 2×10202200312 = 2081697823307281922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1020219994 and 1020220021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020220001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 107141 + ... + 116273.
It is an arithmetic number, because the mean of its divisors is an integer number (135064458).
Almost surely, 21020220031 is an apocalyptic number.
1020220031 is a deficient number, since it is larger than the sum of its proper divisors (60295633).
1020220031 is an equidigital number, since it uses as much as digits as its factorization.
1020220031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15721.
The product of its (nonzero) digits is 24, while the sum is 11.
The square root of 1020220031 is about 31940.8833785166. The cubic root of 1020220031 is about 1006.6950861213.
Adding to 1020220031 its reverse (1300220201), we get a palindrome (2320440232).
The spelling of 1020220031 in words is "one billion, twenty million, two hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •