Base | Representation |
---|---|
bin | 1001010010010011010010… |
… | …0111011100111100100000 |
3 | 1100011001211211221200201122 |
4 | 2110210310213130330200 |
5 | 2314240110111120000 |
6 | 33414230214551412 |
7 | 2102435546144513 |
oct | 224446447347440 |
9 | 40131754850648 |
10 | 10210020020000 |
11 | 3287055143589 |
12 | 118a92b068568 |
13 | 590a543543c8 |
14 | 27424bca4d7a |
15 | 12a8bcdcc085 |
hex | 949349dcf20 |
10210020020000 has 60 divisors (see below), whose sum is σ = 25118180801406. Its totient is φ = 4084008000000.
The previous prime is 10210020019993. The next prime is 10210020020071. The reversal of 10210020020000 is 2002001201.
It can be written as a sum of positive squares in 5 ways, for example, as 984294157456 + 9225725862544 = 992116^2 + 3037388^2 .
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a self number, because there is not a number n which added to its sum of digits gives 10210020020000.
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 255230501 + ... + 255270500.
Almost surely, 210210020020000 is an apocalyptic number.
10210020020000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10210020020000 is an abundant number, since it is smaller than the sum of its proper divisors (14908160781406).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10210020020000 is an frugal number, since it uses more digits than its factorization.
10210020020000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 510501031 (or 510501008 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 10210020020000 its reverse (2002001201), we get a palindrome (10212022021201).
The spelling of 10210020020000 in words is "ten trillion, two hundred ten billion, twenty million, twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •