Base | Representation |
---|---|
bin | 1001010001110010110011… |
… | …0111100111001101000000 |
3 | 1100010020100010220001201210 |
4 | 2110130230313213031000 |
5 | 2314114230311312000 |
6 | 33410225040530120 |
7 | 2102006504114055 |
oct | 224345467471500 |
9 | 40106303801653 |
10 | 10201300104000 |
11 | 328338aa63635 |
12 | 11890b6920940 |
13 | 58cc9491aab5 |
14 | 273a61b5b02c |
15 | 12a55c5c8350 |
hex | 9472cde7340 |
10201300104000 has 112 divisors (see below), whose sum is σ = 33684693022656. Its totient is φ = 2720346688000.
The previous prime is 10201300103989. The next prime is 10201300104011. The reversal of 10201300104000 is 40100310201.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (10201300103989) and next prime (10201300104011).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 212503086 + ... + 212551085.
Almost surely, 210201300104000 is an apocalyptic number.
10201300104000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10201300104000 is an abundant number, since it is smaller than the sum of its proper divisors (23483392918656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10201300104000 is an equidigital number, since it uses as much as digits as its factorization.
10201300104000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 425054201 (or 425054181 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 10201300104000 its reverse (40100310201), we get a palindrome (10241400414201).
The spelling of 10201300104000 in words is "ten trillion, two hundred one billion, three hundred million, one hundred four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •