Base | Representation |
---|---|
bin | 101111001011000010… |
… | …0110110010000011111 |
3 | 100200110220202221001112 |
4 | 1132112010312100133 |
5 | 3124431314213043 |
6 | 114312035332235 |
7 | 10214234436254 |
oct | 1362604662037 |
9 | 320426687045 |
10 | 101302101023 |
11 | 39a64438952 |
12 | 17771a5107b |
13 | 9725501b16 |
14 | 4c8dd6b42b |
15 | 297d6e2518 |
hex | 179613641f |
101302101023 has 4 divisors (see below), whose sum is σ = 107261048160. Its totient is φ = 95343153888.
The previous prime is 101302101001. The next prime is 101302101031. The reversal of 101302101023 is 320101203101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101302101023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101302100989 and 101302101007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101302101323) 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 3 ways as a sum of consecutive naturals, for example, 2979473543 + ... + 2979473576.
It is an arithmetic number, because the mean of its divisors is an integer number (26815262040).
Almost surely, 2101302101023 is an apocalyptic number.
101302101023 is a deficient number, since it is larger than the sum of its proper divisors (5958947137).
101302101023 is an equidigital number, since it uses as much as digits as its factorization.
101302101023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5958947136.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 101302101023 its reverse (320101203101), we get a palindrome (421403304124).
The spelling of 101302101023 in words is "one hundred one billion, three hundred two million, one hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •