Base | Representation |
---|---|
bin | 11101011001101011100… |
… | …11110110110110010010 |
3 | 10120120112222100100102200 |
4 | 32230311303312312102 |
5 | 113022412321213020 |
6 | 2052031054424030 |
7 | 132662124114621 |
oct | 16546563666622 |
9 | 3516488310380 |
10 | 1010220101010 |
11 | 35a482a0206a |
12 | 143954802016 |
13 | 7435675a6a3 |
14 | 36c759016b8 |
15 | 1b428aee590 |
hex | eb35cf6d92 |
1010220101010 has 24 divisors (see below), whose sum is σ = 2626572262860. Its totient is φ = 269392026912.
The previous prime is 1010220100999. The next prime is 1010220101027. The reversal of 1010220101010 is 101010220101.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 912217920201 + 98002180809 = 955101^2 + 313053^2 .
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 = 1010220100983 and 1010220101001.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5612333805 + ... + 5612333984.
Almost surely, 21010220101010 is an apocalyptic number.
1010220101010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1010220101010 is an abundant number, since it is smaller than the sum of its proper divisors (1616352161850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010220101010 is a wasteful number, since it uses less digits than its factorization.
1010220101010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11224667802 (or 11224667799 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1010220101010 its reverse (101010220101), we get a palindrome (1111230321111).
The spelling of 1010220101010 in words is "one trillion, ten billion, two hundred twenty million, one hundred one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •