Base | Representation |
---|---|
bin | 11101101100010011110… |
… | …10010000110100110100 |
3 | 10121112100221210201010110 |
4 | 32312021322100310310 |
5 | 113203403034013022 |
6 | 2100403312423020 |
7 | 133465012265523 |
oct | 16661172206464 |
9 | 3545327721113 |
10 | 1020221001012 |
11 | 363745181284 |
12 | 145885b47a70 |
13 | 7528b6a16b5 |
14 | 37543c1a4ba |
15 | 1b811ad900c |
hex | ed89e90d34 |
1020221001012 has 24 divisors (see below), whose sum is σ = 2380541640736. Its totient is φ = 340069956768.
The previous prime is 1020221000989. The next prime is 1020221001017. The reversal of 1020221001012 is 2101001220201.
1020221001012 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020221001017) 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, 825258 + ... + 1649694.
Almost surely, 21020221001012 is an apocalyptic number.
1020221001012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1020221001012 is an abundant number, since it is smaller than the sum of its proper divisors (1360320639724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020221001012 is a wasteful number, since it uses less digits than its factorization.
1020221001012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 927567 (or 927565 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1020221001012 its reverse (2101001220201), we get a palindrome (3121222221213).
The spelling of 1020221001012 in words is "one trillion, twenty billion, two hundred twenty-one million, one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •