Base | Representation |
---|---|
bin | 11001111111110010010101… |
… | …001100001010001011011101 |
3 | 112222211021102010222210202012 |
4 | 121333302111030022023131 |
5 | 104441224110244142000 |
6 | 1043100320432241005 |
7 | 33040253204230604 |
oct | 3177622514121335 |
9 | 488737363883665 |
10 | 114334532412125 |
11 | 33481003940433 |
12 | 109a696b6a0165 |
13 | 4ba49142a523c |
14 | 2033b6c772a3b |
15 | d34184847735 |
hex | 67fc9530a2dd |
114334532412125 has 32 divisors (see below), whose sum is σ = 155166320570976. Its totient is φ = 83760496819200.
The previous prime is 114334532412011. The next prime is 114334532412151. The reversal of 114334532412125 is 521214235433411.
It can be written as a sum of positive squares in 16 ways, for example, as 80571250870201 + 33763281541924 = 8976149^2 + 5810618^2 .
It is a de Polignac number, because none of the positive numbers 2k-114334532412125 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 727009022 + ... + 727166271.
It is an arithmetic number, because the mean of its divisors is an integer number (4848947517843).
Almost surely, 2114334532412125 is an apocalyptic number.
It is an amenable number.
114334532412125 is a deficient number, since it is larger than the sum of its proper divisors (40831788158851).
114334532412125 is a wasteful number, since it uses less digits than its factorization.
114334532412125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1454175362 (or 1454175352 counting only the distinct ones).
The product of its digits is 345600, while the sum is 41.
Adding to 114334532412125 its reverse (521214235433411), we get a palindrome (635548767845536).
The spelling of 114334532412125 in words is "one hundred fourteen trillion, three hundred thirty-four billion, five hundred thirty-two million, four hundred twelve thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •