Base | Representation |
---|---|
bin | 10110111101110001011100… |
… | …010101010000111111000000 |
3 | 111020121200211001010001100122 |
4 | 112331301130111100333000 |
5 | 101214304044000324300 |
6 | 554451402300235412 |
7 | 30163103500540601 |
oct | 2675613425207700 |
9 | 436550731101318 |
10 | 101002000011200 |
11 | 2a200786987092 |
12 | b3b2a4553bb68 |
13 | 44485a8890c62 |
14 | 1ad2746b17da8 |
15 | ba24618ebc85 |
hex | 5bdc5c550fc0 |
101002000011200 has 84 divisors (see below), whose sum is σ = 251522360418840. Its totient is φ = 39914043325440.
The previous prime is 101002000011179. The next prime is 101002000011203. The reversal of 101002000011200 is 2110000200101.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101002000011203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 380145815 + ... + 380411414.
It is an arithmetic number, because the mean of its divisors is an integer number (2994313814510).
Almost surely, 2101002000011200 is an apocalyptic number.
101002000011200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101002000011200 is an abundant number, since it is smaller than the sum of its proper divisors (150520360407640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101002000011200 is an equidigital number, since it uses as much as digits as its factorization.
101002000011200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 760557334 (or 760557319 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 101002000011200 its reverse (2110000200101), we get a palindrome (103112000211301).
The spelling of 101002000011200 in words is "one hundred one trillion, two billion, eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •