Base | Representation |
---|---|
bin | 10111000000101010111110… |
… | …110101100001101100000100 |
3 | 111021022202001002210112002200 |
4 | 113000222332311201230010 |
5 | 101231040100102143022 |
6 | 555123111004234500 |
7 | 30213355413243102 |
oct | 2700527665415404 |
9 | 437282032715080 |
10 | 101201221131012 |
11 | 2a278219022052 |
12 | b42558423ba30 |
13 | 4461307713282 |
14 | 1adc2455aac72 |
15 | ba77217bbbac |
hex | 5c0abed61b04 |
101201221131012 has 72 divisors (see below), whose sum is σ = 262734550530816. Its totient is φ = 32821211202624.
The previous prime is 101201221131001. The next prime is 101201221131029. The reversal of 101201221131012 is 210131122102101.
It is a happy number.
101201221131012 is a `hidden beast` number, since 1 + 0 + 120 + 1 + 221 + 1 + 310 + 12 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
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, 54534573 + ... + 56359755.
Almost surely, 2101201221131012 is an apocalyptic number.
101201221131012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101201221131012 is an abundant number, since it is smaller than the sum of its proper divisors (161533329399804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101201221131012 is a wasteful number, since it uses less digits than its factorization.
101201221131012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1866857 (or 1866852 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 101201221131012 its reverse (210131122102101), we get a palindrome (311332343233113).
The spelling of 101201221131012 in words is "one hundred one trillion, two hundred one billion, two hundred twenty-one million, one hundred thirty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •