Base | Representation |
---|---|
bin | 10111000000110011001010… |
… | …101100110100110010011110 |
3 | 111021100120201121210222020222 |
4 | 113000303022230310302132 |
5 | 101231211100042024014 |
6 | 555131123050441342 |
7 | 30214116254321621 |
oct | 2700631254646236 |
9 | 437316647728228 |
10 | 101210010111134 |
11 | 2a280a19193991 |
12 | b427217733252 |
13 | 44620a854b422 |
14 | 1adc83a971db8 |
15 | ba7a881b408e |
hex | 5c0ccab34c9e |
101210010111134 has 8 divisors (see below), whose sum is σ = 151815311598960. Its totient is φ = 50604906244816.
The previous prime is 101210010111121. The next prime is 101210010111137. The reversal of 101210010111134 is 431111010012101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1012100101111342 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101210010111137) 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 3 ways as a sum of consecutive naturals, for example, 48118319 + ... + 50177610.
It is an arithmetic number, because the mean of its divisors is an integer number (18976913949870).
Almost surely, 2101210010111134 is an apocalyptic number.
101210010111134 is a deficient number, since it is larger than the sum of its proper divisors (50605301487826).
101210010111134 is an equidigital number, since it uses as much as digits as its factorization.
101210010111134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98810754.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 101210010111134 its reverse (431111010012101), we get a palindrome (532321020123235).
The spelling of 101210010111134 in words is "one hundred one trillion, two hundred ten billion, ten million, one hundred eleven thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •