Base | Representation |
---|---|
bin | 110101010100011010… |
… | …0010111111100000101 |
3 | 101221112210200101222221 |
4 | 1222220310113330011 |
5 | 3333444332422100 |
6 | 124333511252341 |
7 | 11162311164556 |
oct | 1525064277405 |
9 | 357483611887 |
10 | 114501451525 |
11 | 446180a228a |
12 | 1a23637a0b1 |
13 | aa49c912a6 |
14 | 5782d8a32d |
15 | 2ea23c101a |
hex | 1aa8d17f05 |
114501451525 has 24 divisors (see below), whose sum is σ = 145938485480. Its totient is φ = 89052514560.
The previous prime is 114501451523. The next prime is 114501451529. The reversal of 114501451525 is 525154105411.
It can be written as a sum of positive squares in 12 ways, for example, as 41705764 + 114459745761 = 6458^2 + 338319^2 .
It is not a de Polignac number, because 114501451525 - 21 = 114501451523 is a prime.
It is a super-2 number, since 2×1145014515252 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114501451523) 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 23 ways as a sum of consecutive naturals, for example, 1094191 + ... + 1194259.
Almost surely, 2114501451525 is an apocalyptic number.
It is an amenable number.
114501451525 is a deficient number, since it is larger than the sum of its proper divisors (31437033955).
114501451525 is a wasteful number, since it uses less digits than its factorization.
114501451525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101353 (or 101348 counting only the distinct ones).
The product of its (nonzero) digits is 20000, while the sum is 34.
Adding to 114501451525 its reverse (525154105411), we get a palindrome (639655556936).
The spelling of 114501451525 in words is "one hundred fourteen billion, five hundred one million, four hundred fifty-one thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •