Base | Representation |
---|---|
bin | 101111001011010011… |
… | …0111000011110101111 |
3 | 100200111112120012201222 |
4 | 1132112212320132233 |
5 | 3124441110214043 |
6 | 114312554453555 |
7 | 10214403326030 |
oct | 1362646703657 |
9 | 320445505658 |
10 | 101311023023 |
11 | 39a69482101 |
12 | 17774a342bb |
13 | 9727306b02 |
14 | 4c91210a87 |
15 | 297e3a5d68 |
hex | 17969b87af |
101311023023 has 8 divisors (see below), whose sum is σ = 117682125600. Its totient is φ = 85414445280.
The previous prime is 101311022993. The next prime is 101311023127. The reversal of 101311023023 is 320320113101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101311023023 - 218 = 101310760879 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101311022992 and 101311023010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101311028023) 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, 118630748 + ... + 118631601.
It is an arithmetic number, because the mean of its divisors is an integer number (14710265700).
Almost surely, 2101311023023 is an apocalyptic number.
101311023023 is a deficient number, since it is larger than the sum of its proper divisors (16371102577).
101311023023 is an equidigital number, since it uses as much as digits as its factorization.
101311023023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237262417.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 101311023023 its reverse (320320113101), we get a palindrome (421631136124).
The spelling of 101311023023 in words is "one hundred one billion, three hundred eleven million, twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •