Base | Representation |
---|---|
bin | 111100001101100… |
… | …111000110111110 |
3 | 2121101212112021200 |
4 | 330031213012332 |
5 | 4032102413042 |
6 | 244124040330 |
7 | 34014365325 |
oct | 7415470676 |
9 | 2541775250 |
10 | 1010201022 |
11 | 479260a86 |
12 | 2423930a6 |
13 | 13139c3ac |
14 | 982450bc |
15 | 5da48c4c |
hex | 3c3671be |
1010201022 has 24 divisors (see below), whose sum is σ = 2264244840. Its totient is φ = 325122000.
The previous prime is 1010200981. The next prime is 1010201029. The reversal of 1010201022 is 2201020101.
It is a super-2 number, since 2×10102010222 = 2041012209699688968, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1010200995 and 1010201013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010201029) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 967104 + ... + 968147.
It is an arithmetic number, because the mean of its divisors is an integer number (94343535).
Almost surely, 21010201022 is an apocalyptic number.
1010201022 is an abundant number, since it is smaller than the sum of its proper divisors (1254043818).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010201022 is a wasteful number, since it uses less digits than its factorization.
1010201022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1935288 (or 1935285 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
The square root of 1010201022 is about 31783.6596697108. The cubic root of 1010201022 is about 1003.3888434341.
Adding to 1010201022 its reverse (2201020101), we get a palindrome (3211221123).
The spelling of 1010201022 in words is "one billion, ten million, two hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •