Base | Representation |
---|---|
bin | 10111000100000011110001… |
… | …100010110111111101110000 |
3 | 111022010222212212112001022021 |
4 | 113010003301202313331300 |
5 | 101243343313012113040 |
6 | 555422045241521224 |
7 | 30236236040036554 |
oct | 2704036142677560 |
9 | 438128785461267 |
10 | 101434000113520 |
11 | 2a357a10759a38 |
12 | b4627094a3214 |
13 | 447a253a76189 |
14 | 1b09608c09864 |
15 | bad7e780224a |
hex | 5c40f18b7f70 |
101434000113520 has 40 divisors (see below), whose sum is σ = 236381229115200. Its totient is φ = 40479461748480.
The previous prime is 101434000113503. The next prime is 101434000113547. The reversal of 101434000113520 is 25311000434101.
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1470876195 + ... + 1470945154.
It is an arithmetic number, because the mean of its divisors is an integer number (5909530727880).
Almost surely, 2101434000113520 is an apocalyptic number.
101434000113520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101434000113520 is an abundant number, since it is smaller than the sum of its proper divisors (134947229001680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101434000113520 is a wasteful number, since it uses less digits than its factorization.
101434000113520 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2941821793 (or 2941821787 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 101434000113520 its reverse (25311000434101), we get a palindrome (126745000547621).
The spelling of 101434000113520 in words is "one hundred one trillion, four hundred thirty-four billion, one hundred thirteen thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •