Base | Representation |
---|---|
bin | 1010011101101100000001… |
… | …10000011111011101000111 |
3 | 10000110202121100222222221222 |
4 | 11032312000300133131013 |
5 | 11004000043300000241 |
6 | 120534441430230555 |
7 | 4563303453600506 |
oct | 516660060373507 |
9 | 100422540888858 |
10 | 23010300000071 |
11 | 737168252226a |
12 | 26b7672ab545b |
13 | cabb289cbc27 |
14 | 5979c108a83d |
15 | 29d83d996a4b |
hex | 14ed80c1f747 |
23010300000071 has 2 divisors, whose sum is σ = 23010300000072. Its totient is φ = 23010300000070.
The previous prime is 23010299999941. The next prime is 23010300000089. The reversal of 23010300000071 is 17000000301032.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23010300000071 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 23010299999995 and 23010300000049.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23010300008071) 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 as a sum of consecutive naturals, namely, 11505150000035 + 11505150000036.
It is an arithmetic number, because the mean of its divisors is an integer number (11505150000036).
Almost surely, 223010300000071 is an apocalyptic number.
23010300000071 is a deficient number, since it is larger than the sum of its proper divisors (1).
23010300000071 is an equidigital number, since it uses as much as digits as its factorization.
23010300000071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 126, while the sum is 17.
It can be divided in two parts, 230 and 10300000071, that added together give a palindrome (10300000301).
The spelling of 23010300000071 in words is "twenty-three trillion, ten billion, three hundred million, seventy-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •