Base | Representation |
---|---|
bin | 110101101101011001… |
… | …1111100110111001111 |
3 | 102000201020221022112222 |
4 | 1223122303330313033 |
5 | 3342204042421143 |
6 | 124553032445555 |
7 | 11222144351546 |
oct | 1533263746717 |
9 | 360636838488 |
10 | 115340201423 |
11 | 44a0859a517 |
12 | 1a42b2498bb |
13 | ab519909c5 |
14 | 582252115d |
15 | 3000d4e768 |
hex | 1adacfcdcf |
115340201423 has 12 divisors (see below), whose sum is σ = 123196901688. Its totient is φ = 107953134480.
The previous prime is 115340201419. The next prime is 115340201453. The reversal of 115340201423 is 324102043511.
It is a happy number.
It is not a de Polignac number, because 115340201423 - 22 = 115340201419 is a prime.
It is a super-2 number, since 2×1153402014232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 115340201392 and 115340201401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115340201453) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1894748 + ... + 1954673.
It is an arithmetic number, because the mean of its divisors is an integer number (10266408474).
Almost surely, 2115340201423 is an apocalyptic number.
115340201423 is a deficient number, since it is larger than the sum of its proper divisors (7856700265).
115340201423 is an equidigital number, since it uses as much as digits as its factorization.
115340201423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3849542 (or 3849523 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 115340201423 its reverse (324102043511), we get a palindrome (439442244934).
The spelling of 115340201423 in words is "one hundred fifteen billion, three hundred forty million, two hundred one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •