Base | Representation |
---|---|
bin | 11101011011001001110… |
… | …01011101101111101010 |
3 | 10120122121000212110121000 |
4 | 32231210321131233222 |
5 | 113031022041201302 |
6 | 2052241315055430 |
7 | 133020526026354 |
oct | 16554471355752 |
9 | 3518530773530 |
10 | 1011010100202 |
11 | 35a848932163 |
12 | 143b352a1576 |
13 | 7445131b52b |
14 | 36d0c7c60d4 |
15 | 1b47314d31c |
hex | eb64e5dbea |
1011010100202 has 16 divisors (see below), whose sum is σ = 2246689111680. Its totient is φ = 337003366716.
The previous prime is 1011010100179. The next prime is 1011010100207. The reversal of 1011010100202 is 2020010101101.
It is a happy number.
It is a super-3 number, since 3×10110101002023 (a number of 37 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (1011010100207) 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, 9361204578 + ... + 9361204685.
It is an arithmetic number, because the mean of its divisors is an integer number (140418069480).
Almost surely, 21011010100202 is an apocalyptic number.
1011010100202 is an abundant number, since it is smaller than the sum of its proper divisors (1235679011478).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011010100202 is a wasteful number, since it uses less digits than its factorization.
1011010100202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18722409274 (or 18722409268 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1011010100202 its reverse (2020010101101), we get a palindrome (3031020201303).
The spelling of 1011010100202 in words is "one trillion, eleven billion, ten million, one hundred thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •