Base | Representation |
---|---|
bin | 10110111101111011110010… |
… | …101110010101101101000000 |
3 | 111020122202111112100111210121 |
4 | 112331323302232111231000 |
5 | 101214444323423213440 |
6 | 554500441124310024 |
7 | 30163646052334633 |
oct | 2675736256255500 |
9 | 436582445314717 |
10 | 101013113101120 |
11 | 2a205469a37020 |
12 | b3b5027242314 |
13 | 444965a0631cc |
14 | 1ad30bca25c1a |
15 | ba28b237934a |
hex | 5bdef2b95b40 |
101013113101120 has 112 divisors (see below), whose sum is σ = 265726095724800. Its totient is φ = 36267078481920.
The previous prime is 101013113101097. The next prime is 101013113101169. The reversal of 101013113101120 is 21101311310101.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a junction number, because it is equal to n+sod(n) for n = 101013113101094 and 101013113101103.
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, 181347915 + ... + 181904074.
Almost surely, 2101013113101120 is an apocalyptic number.
101013113101120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101013113101120 is an abundant number, since it is smaller than the sum of its proper divisors (164712982623680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101013113101120 is a wasteful number, since it uses less digits than its factorization.
101013113101120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 363252096 (or 363252086 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 16.
Adding to 101013113101120 its reverse (21101311310101), we get a palindrome (122114424411221).
The spelling of 101013113101120 in words is "one hundred one trillion, thirteen billion, one hundred thirteen million, one hundred one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •