Base | Representation |
---|---|
bin | 111100001101101… |
… | …011101111111111 |
3 | 2121101220111100201 |
4 | 330031223233333 |
5 | 4032104020111 |
6 | 244124304331 |
7 | 34014504622 |
oct | 7415535777 |
9 | 2541814321 |
10 | 1010220031 |
11 | 479274297 |
12 | 2423a20a7 |
13 | 1313a7c42 |
14 | 9824bdb9 |
15 | 5da4e6c1 |
hex | 3c36bbff |
1010220031 has 4 divisors (see below), whose sum is σ = 1014245064. Its totient is φ = 1006195000.
The previous prime is 1010220023. The next prime is 1010220041. The reversal of 1010220031 is 1300220101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1300220101 = 607 ⋅2142043.
It is a cyclic number.
It is not a de Polignac number, because 1010220031 - 23 = 1010220023 is a prime.
It is a super-2 number, since 2×10102200312 = 2041089022067281922, 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 (1010220041) 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, 2012140 + ... + 2012641.
It is an arithmetic number, because the mean of its divisors is an integer number (253561266).
Almost surely, 21010220031 is an apocalyptic number.
1010220031 is a deficient number, since it is larger than the sum of its proper divisors (4025033).
1010220031 is an equidigital number, since it uses as much as digits as its factorization.
1010220031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4025032.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 1010220031 is about 31783.9587056112. The cubic root of 1010220031 is about 1003.3951369996.
Adding to 1010220031 its reverse (1300220101), we get a palindrome (2310440132).
The spelling of 1010220031 in words is "one billion, ten million, two hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •