Base | Representation |
---|---|
bin | 101111000101111010… |
… | …0101110010011111011 |
3 | 100200000221010110202202 |
4 | 1132023310232103323 |
5 | 3124103301231021 |
6 | 114243013020415 |
7 | 10210045453361 |
oct | 1361364562373 |
9 | 320027113682 |
10 | 101130102011 |
11 | 39986340504 |
12 | 1772432470b |
13 | 96c899c963 |
14 | 4c75197631 |
15 | 296d569a0b |
hex | 178bd2e4fb |
101130102011 has 8 divisors (see below), whose sum is σ = 105577774080. Its totient is φ = 96686655912.
The previous prime is 101130101981. The next prime is 101130102019. The reversal of 101130102011 is 110201031101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101130102011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101130101983 and 101130102001.
It is not an unprimeable number, because it can be changed into a prime (101130102019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1007531 + ... + 1103348.
It is an arithmetic number, because the mean of its divisors is an integer number (13197221760).
Almost surely, 2101130102011 is an apocalyptic number.
101130102011 is a deficient number, since it is larger than the sum of its proper divisors (4447672069).
101130102011 is a wasteful number, since it uses less digits than its factorization.
101130102011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2112985.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 101130102011 its reverse (110201031101), we get a palindrome (211331133112).
The spelling of 101130102011 in words is "one hundred one billion, one hundred thirty million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •