Base | Representation |
---|---|
bin | 110101110110001011… |
… | …0101100010101000101 |
3 | 102001110202202022200100 |
4 | 1223230112230111011 |
5 | 3343304414141123 |
6 | 125042145034313 |
7 | 11232350133405 |
oct | 1535426542505 |
9 | 361422668610 |
10 | 115634521413 |
11 | 45049744484 |
12 | 1a4b1925999 |
13 | ab9a950348 |
14 | 584d656805 |
15 | 301bada643 |
hex | 1aec5ac545 |
115634521413 has 6 divisors (see below), whose sum is σ = 167027642054. Its totient is φ = 77089680936.
The previous prime is 115634521411. The next prime is 115634521433. The reversal of 115634521413 is 314125436511.
115634521413 is a `hidden beast` number, since 1 + 1 + 5 + 63 + 452 + 141 + 3 = 666.
It can be written as a sum of positive squares in only one way, i.e., 92065516929 + 23569004484 = 303423^2 + 153522^2 .
It is not a de Polignac number, because 115634521413 - 21 = 115634521411 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115634521411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 6424140070 + ... + 6424140087.
Almost surely, 2115634521413 is an apocalyptic number.
It is an amenable number.
115634521413 is a deficient number, since it is larger than the sum of its proper divisors (51393120641).
115634521413 is a wasteful number, since it uses less digits than its factorization.
115634521413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12848280163 (or 12848280160 counting only the distinct ones).
The product of its digits is 43200, while the sum is 36.
Adding to 115634521413 its reverse (314125436511), we get a palindrome (429759957924).
The spelling of 115634521413 in words is "one hundred fifteen billion, six hundred thirty-four million, five hundred twenty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •