Base | Representation |
---|---|
bin | 10110111111101001101101… |
… | …010000101001101010001100 |
3 | 111021002001010112200020121110 |
4 | 112333221231100221222030 |
5 | 101223413030024024400 |
6 | 555031000125132020 |
7 | 30205324516242162 |
oct | 2677515520515214 |
9 | 437061115606543 |
10 | 101131133033100 |
11 | 2a250522128795 |
12 | b413a839ba010 |
13 | 4457817c616a1 |
14 | 1ad8ab6dc1232 |
15 | ba59bd5a7e50 |
hex | 5bfa6d429a8c |
101131133033100 has 72 divisors (see below), whose sum is σ = 293370063114240. Its totient is φ = 26897888790080.
The previous prime is 101131133033059. The next prime is 101131133033131. The reversal of 101131133033100 is 1330331131101.
It is a super-2 number, since 2×1011311330331002 (a number of 29 digits) contains 22 as substring.
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, 439968360 + ... + 440198159.
It is an arithmetic number, because the mean of its divisors is an integer number (4074584209920).
Almost surely, 2101131133033100 is an apocalyptic number.
101131133033100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101131133033100 is an abundant number, since it is smaller than the sum of its proper divisors (192238930081140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101131133033100 is a wasteful number, since it uses less digits than its factorization.
101131133033100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 880166919 (or 880166912 counting only the distinct ones).
The product of its (nonzero) digits is 243, while the sum is 21.
Adding to 101131133033100 its reverse (1330331131101), we get a palindrome (102461464164201).
The spelling of 101131133033100 in words is "one hundred one trillion, one hundred thirty-one billion, one hundred thirty-three million, thirty-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •