Base | Representation |
---|---|
bin | 100001011110000101001… |
… | …100011001011100111101 |
3 | 22010212210220000221200212 |
4 | 201132011030121130331 |
5 | 300140441240414234 |
6 | 4520342541002205 |
7 | 325113121320245 |
oct | 41360514313475 |
9 | 8125726027625 |
10 | 2300042123069 |
11 | 8074958a8839 |
12 | 31191b553365 |
13 | 138b7c020c72 |
14 | 7d473438b25 |
15 | 3ec6920c5ce |
hex | 2178531973d |
2300042123069 has 2 divisors, whose sum is σ = 2300042123070. Its totient is φ = 2300042123068.
The previous prime is 2300042123021. The next prime is 2300042123149. The reversal of 2300042123069 is 9603212400032.
2300042123069 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2050180104025 + 249862019044 = 1431845^2 + 499862^2 .
It is a cyclic number.
It is not a de Polignac number, because 2300042123069 - 28 = 2300042122813 is a prime.
It is a super-2 number, since 2×23000421230692 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2300042123669) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1150021061534 + 1150021061535.
It is an arithmetic number, because the mean of its divisors is an integer number (1150021061535).
Almost surely, 22300042123069 is an apocalyptic number.
It is an amenable number.
2300042123069 is a deficient number, since it is larger than the sum of its proper divisors (1).
2300042123069 is an equidigital number, since it uses as much as digits as its factorization.
2300042123069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 32.
The spelling of 2300042123069 in words is "two trillion, three hundred billion, forty-two million, one hundred twenty-three thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •