Base | Representation |
---|---|
bin | 101111000101101111… |
… | …0010011010000001101 |
3 | 100200000112001211200010 |
4 | 1132023132103100031 |
5 | 3124100300132023 |
6 | 114242243023433 |
7 | 10206644502351 |
oct | 1361336232015 |
9 | 320015054603 |
10 | 101124224013 |
11 | 39982a9625a |
12 | 1772236ab79 |
13 | 96c76c2357 |
14 | 4c744a7461 |
15 | 296cca8093 |
hex | 178b79340d |
101124224013 has 8 divisors (see below), whose sum is σ = 135123515008. Its totient is φ = 67270541184.
The previous prime is 101124223973. The next prime is 101124224087. The reversal of 101124224013 is 310422421101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101124224013 - 222 = 101120029709 is a prime.
It is a super-2 number, since 2×1011242240132 (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 (101124224713) 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 7 ways as a sum of consecutive naturals, for example, 36400420 + ... + 36403197.
It is an arithmetic number, because the mean of its divisors is an integer number (16890439376).
Almost surely, 2101124224013 is an apocalyptic number.
It is an amenable number.
101124224013 is a deficient number, since it is larger than the sum of its proper divisors (33999290995).
101124224013 is an equidigital number, since it uses as much as digits as its factorization.
101124224013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72804083.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 101124224013 its reverse (310422421101), we get a palindrome (411546645114).
The spelling of 101124224013 in words is "one hundred one billion, one hundred twenty-four million, two hundred twenty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •