Base | Representation |
---|---|
bin | 1000101110100111… |
… | …1000011100000101 |
3 | 20001021210100100222 |
4 | 2023221320130011 |
5 | 14244302341401 |
6 | 1024254514125 |
7 | 112030163033 |
oct | 21351703405 |
9 | 6037710328 |
10 | 2343012101 |
11 | aa2629741 |
12 | 554805945 |
13 | 2b45549c1 |
14 | 183267553 |
15 | daa6ac1b |
hex | 8ba78705 |
2343012101 has 2 divisors, whose sum is σ = 2343012102. Its totient is φ = 2343012100.
The previous prime is 2343012083. The next prime is 2343012107. The reversal of 2343012101 is 1012103432.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2290101025 + 52911076 = 47855^2 + 7274^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2343012101 is a prime.
It is an alternating number because its digits alternate between even and odd.
It is a self number, because there is not a number n which added to its sum of digits gives 2343012101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2343012107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1171506050 + 1171506051.
It is an arithmetic number, because the mean of its divisors is an integer number (1171506051).
Almost surely, 22343012101 is an apocalyptic number.
It is an amenable number.
2343012101 is a deficient number, since it is larger than the sum of its proper divisors (1).
2343012101 is an equidigital number, since it uses as much as digits as its factorization.
2343012101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 2343012101 is about 48404.6702395544. The cubic root of 2343012101 is about 1328.1837951225.
Adding to 2343012101 its reverse (1012103432), we get a palindrome (3355115533).
The spelling of 2343012101 in words is "two billion, three hundred forty-three million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •