Base | Representation |
---|---|
bin | 10010101001101010… |
… | …10101011001010000 |
3 | 221211211121100212100 |
4 | 21110311111121100 |
5 | 131001334431000 |
6 | 4333333400400 |
7 | 503064545514 |
oct | 112465253120 |
9 | 27754540770 |
10 | 10013202000 |
11 | 427921195a |
12 | 1b35499100 |
13 | c376605c9 |
14 | 6adbdc144 |
15 | 3d9119a00 |
hex | 254d55650 |
10013202000 has 120 divisors (see below), whose sum is σ = 34972839720. Its totient is φ = 2670182400.
The previous prime is 10013201987. The next prime is 10013202019. The reversal of 10013202000 is 20231001.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 1238758416 + 8774443584 = 35196^2 + 93672^2 .
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 260145 + ... + 296144.
It is an arithmetic number, because the mean of its divisors is an integer number (291440331).
Almost surely, 210013202000 is an apocalyptic number.
10013202000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10013202000 is an abundant number, since it is smaller than the sum of its proper divisors (24959637720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10013202000 is a wasteful number, since it uses less digits than its factorization.
10013202000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 556318 (or 556299 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
Adding to 10013202000 its reverse (20231001), we get a palindrome (10033433001).
The spelling of 10013202000 in words is "ten billion, thirteen million, two hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •