Base | Representation |
---|---|
bin | 1001010001110001101011… |
… | …1111100100011101000000 |
3 | 1100010012120020120100210020 |
4 | 2110130122333210131000 |
5 | 2314113122022400000 |
6 | 33410135204533440 |
7 | 2101666203014301 |
oct | 224343277443500 |
9 | 40105506510706 |
10 | 10201000200000 |
11 | 3283246745295 |
12 | 11890323b1280 |
13 | 58cc477548cc |
14 | 273a33db07a8 |
15 | 12a5410d7ba0 |
hex | 9471afe4740 |
10201000200000 has 168 divisors, whose sum is σ = 33735525725664. Its totient is φ = 2720266560000.
The previous prime is 10201000199953. The next prime is 10201000200037. The reversal of 10201000200000 is 200010201.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
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, 7900834 + ... + 9100833.
It is an arithmetic number, because the mean of its divisors is an integer number (200806700748).
Almost surely, 210201000200000 is an apocalyptic number.
10201000200000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10201000200000 is an abundant number, since it is smaller than the sum of its proper divisors (23534525525664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10201000200000 is an frugal number, since it uses more digits than its factorization.
10201000200000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17001707 (or 17001677 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 6.
Adding to 10201000200000 its reverse (200010201), we get a palindrome (10201200210201).
The spelling of 10201000200000 in words is "ten trillion, two hundred one billion, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •