Base | Representation |
---|---|
bin | 101111000101111100… |
… | …0101010000100011101 |
3 | 100200001000001212022102 |
4 | 1132023320222010131 |
5 | 3124104032230323 |
6 | 114243051054445 |
7 | 10210060306655 |
oct | 1361370520435 |
9 | 320030055272 |
10 | 101131133213 |
11 | 39986985240 |
12 | 17724741425 |
13 | 96c8c71136 |
14 | 4c75385365 |
15 | 296d6c0328 |
hex | 178be2a11d |
101131133213 has 24 divisors (see below), whose sum is σ = 117260305344. Its totient is φ = 86482073600.
The previous prime is 101131133209. The next prime is 101131133219. The reversal of 101131133213 is 312331131101.
It is not a de Polignac number, because 101131133213 - 22 = 101131133209 is a prime.
It is a super-2 number, since 2×1011311332132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101131133219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6607856 + ... + 6623142.
It is an arithmetic number, because the mean of its divisors is an integer number (4885846056).
Almost surely, 2101131133213 is an apocalyptic number.
It is an amenable number.
101131133213 is a deficient number, since it is larger than the sum of its proper divisors (16129172131).
101131133213 is a wasteful number, since it uses less digits than its factorization.
101131133213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17413 (or 17396 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 101131133213 its reverse (312331131101), we get a palindrome (413462264314).
The spelling of 101131133213 in words is "one hundred one billion, one hundred thirty-one million, one hundred thirty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •