Base | Representation |
---|---|
bin | 11010001011011001011011… |
… | …000001100111000100001111 |
3 | 120002122112220100011112220011 |
4 | 122023121123001213010033 |
5 | 110042312144121013031 |
6 | 1044511034230534051 |
7 | 33152020465033051 |
oct | 3213313301470417 |
9 | 502575810145804 |
10 | 115132420485391 |
11 | 33759426960331 |
12 | 10ab5526807327 |
13 | 4c31c2c84920a |
14 | 20606204258d1 |
15 | d49cd25186b1 |
hex | 68b65b06710f |
115132420485391 has 2 divisors, whose sum is σ = 115132420485392. Its totient is φ = 115132420485390.
The previous prime is 115132420485367. The next prime is 115132420485421. The reversal of 115132420485391 is 193584024231511.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-115132420485391 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115132420485301) 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 as a sum of consecutive naturals, namely, 57566210242695 + 57566210242696.
It is an arithmetic number, because the mean of its divisors is an integer number (57566210242696).
Almost surely, 2115132420485391 is an apocalyptic number.
115132420485391 is a deficient number, since it is larger than the sum of its proper divisors (1).
115132420485391 is an equidigital number, since it uses as much as digits as its factorization.
115132420485391 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1036800, while the sum is 49.
The spelling of 115132420485391 in words is "one hundred fifteen trillion, one hundred thirty-two billion, four hundred twenty million, four hundred eighty-five thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •