Base | Representation |
---|---|
bin | 11101011001011101011… |
… | …10010010010101001000 |
3 | 10120120020200121120011222 |
4 | 32230232232102111020 |
5 | 113022141401401300 |
6 | 2052011210141212 |
7 | 132656151352211 |
oct | 16545656222510 |
9 | 3516220546158 |
10 | 1010101200200 |
11 | 35a421881134 |
12 | 143920a21808 |
13 | 74337c29b91 |
14 | 36c63bd0408 |
15 | 1b41d464785 |
hex | eb2eb92548 |
1010101200200 has 48 divisors (see below), whose sum is σ = 2348631487860. Its totient is φ = 404015328000.
The previous prime is 1010101200161. The next prime is 1010101200211. The reversal of 1010101200200 is 20021010101.
1010101200200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 370878564004 + 639222636196 = 608998^2 + 799514^2 .
It is a Harshad number since it is a multiple of its sum of digits (8).
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, 3247490 + ... + 3544910.
Almost surely, 21010101200200 is an apocalyptic number.
1010101200200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1010101200200 is an abundant number, since it is smaller than the sum of its proper divisors (1338530287660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010101200200 is a wasteful number, since it uses less digits than its factorization.
1010101200200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 314418 (or 314409 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 1010101200200 its reverse (20021010101), we get a palindrome (1030122210301).
The spelling of 1010101200200 in words is "one trillion, ten billion, one hundred one million, two hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •