Base | Representation |
---|---|
bin | 110101010101000000… |
… | …0111100110011110011 |
3 | 101221121012110021022011 |
4 | 1222222000330303303 |
5 | 3334020002303431 |
6 | 124335505423351 |
7 | 11162643622342 |
oct | 1525200746363 |
9 | 357535407264 |
10 | 114521525491 |
11 | 4462846313a |
12 | 1a24103ab57 |
13 | aa5119c289 |
14 | 57858d3b59 |
15 | 2ea4038cb1 |
hex | 1aaa03ccf3 |
114521525491 has 4 divisors (see below), whose sum is σ = 121258085832. Its totient is φ = 107784965152.
The previous prime is 114521525449. The next prime is 114521525507. The reversal of 114521525491 is 194525125411.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 114521525491 - 229 = 113984654579 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114521525191) 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 3 ways as a sum of consecutive naturals, for example, 3368280145 + ... + 3368280178.
It is an arithmetic number, because the mean of its divisors is an integer number (30314521458).
Almost surely, 2114521525491 is an apocalyptic number.
114521525491 is a deficient number, since it is larger than the sum of its proper divisors (6736560341).
114521525491 is an equidigital number, since it uses as much as digits as its factorization.
114521525491 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6736560340.
The product of its digits is 72000, while the sum is 40.
The spelling of 114521525491 in words is "one hundred fourteen billion, five hundred twenty-one million, five hundred twenty-five thousand, four hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •