Base | Representation |
---|---|
bin | 110101101010100010… |
… | …1000100000011001101 |
3 | 102000110112221222221200 |
4 | 1223111011010003031 |
5 | 3342004432232023 |
6 | 124535315220113 |
7 | 11216566020126 |
oct | 1532505040315 |
9 | 360415858850 |
10 | 115244024013 |
11 | 44969279a58 |
12 | 1a402ba7639 |
13 | ab37a880b1 |
14 | 581384704d |
15 | 2ee76a2743 |
hex | 1ad51440cd |
115244024013 has 6 divisors (see below), whose sum is σ = 166463590254. Its totient is φ = 76829349336.
The previous prime is 115244024009. The next prime is 115244024023. The reversal of 115244024013 is 310420442511.
115244024013 is a `hidden beast` number, since 1 + 15 + 244 + 0 + 2 + 401 + 3 = 666.
It can be written as a sum of positive squares in only one way, i.e., 103640856489 + 11603167524 = 321933^2 + 107718^2 .
It is not a de Polignac number, because 115244024013 - 22 = 115244024009 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115244024023) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 6402445770 + ... + 6402445787.
It is an arithmetic number, because the mean of its divisors is an integer number (27743931709).
Almost surely, 2115244024013 is an apocalyptic number.
It is an amenable number.
115244024013 is a deficient number, since it is larger than the sum of its proper divisors (51219566241).
115244024013 is a wasteful number, since it uses less digits than its factorization.
115244024013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12804891563 (or 12804891560 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
Adding to 115244024013 its reverse (310420442511), we get a palindrome (425664466524).
The spelling of 115244024013 in words is "one hundred fifteen billion, two hundred forty-four million, twenty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •