Base | Representation |
---|---|
bin | 11010001110000011110010… |
… | …100110000001001001010011 |
3 | 120010022001002011010010100221 |
4 | 122032003302212001021103 |
5 | 110103311320103443233 |
6 | 1045131050312253511 |
7 | 33201154631264026 |
oct | 3216036246011123 |
9 | 503261064103327 |
10 | 115315352015443 |
11 | 33819a69a47418 |
12 | 10b24a7a0a1297 |
13 | 4c46263920a18 |
14 | 20694156c31bd |
15 | d4e93c28d42d |
hex | 68e0f2981253 |
115315352015443 has 2 divisors, whose sum is σ = 115315352015444. Its totient is φ = 115315352015442.
The previous prime is 115315352015441. The next prime is 115315352015557. The reversal of 115315352015443 is 344510253513511.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 115315352015443 - 21 = 115315352015441 is a prime.
It is a super-2 number, since 2×1153153520154432 (a number of 29 digits) contains 22 as substring.
Together with 115315352015441, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 115315352015443.
It is not a weakly prime, because it can be changed into another prime (115315352015441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57657676007721 + 57657676007722.
It is an arithmetic number, because the mean of its divisors is an integer number (57657676007722).
Almost surely, 2115315352015443 is an apocalyptic number.
115315352015443 is a deficient number, since it is larger than the sum of its proper divisors (1).
115315352015443 is an equidigital number, since it uses as much as digits as its factorization.
115315352015443 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 540000, while the sum is 43.
The spelling of 115315352015443 in words is "one hundred fifteen trillion, three hundred fifteen billion, three hundred fifty-two million, fifteen thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •