Base | Representation |
---|---|
bin | 110101100111100001… |
… | …0010100111110111111 |
3 | 102000012111012100020022 |
4 | 1223033002110332333 |
5 | 3341303004044042 |
6 | 124521254242355 |
7 | 11214225215423 |
oct | 1531702247677 |
9 | 360174170208 |
10 | 115142643647 |
11 | 44917025429 |
12 | 1a3950563bb |
13 | ab1ca80205 |
14 | 58041b6b83 |
15 | 2edd828cd2 |
hex | 1acf094fbf |
115142643647 has 4 divisors (see below), whose sum is σ = 115147672200. Its totient is φ = 115137615096.
The previous prime is 115142643643. The next prime is 115142643673. The reversal of 115142643647 is 746346241511.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 746346241511 = 13 ⋅57411249347.
It is a cyclic number.
It is not a de Polignac number, because 115142643647 - 22 = 115142643643 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 115142643598 and 115142643607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115142643643) 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 in 3 ways as a sum of consecutive naturals, for example, 2479772 + ... + 2525777.
It is an arithmetic number, because the mean of its divisors is an integer number (28786918050).
Almost surely, 2115142643647 is an apocalyptic number.
115142643647 is a deficient number, since it is larger than the sum of its proper divisors (5028553).
115142643647 is an equidigital number, since it uses as much as digits as its factorization.
115142643647 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5028552.
The product of its digits is 483840, while the sum is 44.
The spelling of 115142643647 in words is "one hundred fifteen billion, one hundred forty-two million, six hundred forty-three thousand, six hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •