Base | Representation |
---|---|
bin | 11010000010010011000000… |
… | …001101111110101100111001 |
3 | 120000102202201101220210111121 |
4 | 122002103000031332230321 |
5 | 110002040421032022104 |
6 | 1043311451451225241 |
7 | 33055601343110116 |
oct | 3202230015765471 |
9 | 500382641823447 |
10 | 114507053001529 |
11 | 33538194254741 |
12 | 10a14298448221 |
13 | 4bb7c794ba236 |
14 | 203c25709990d |
15 | d388d05d9254 |
hex | 6824c037eb39 |
114507053001529 has 4 divisors (see below), whose sum is σ = 114507075610240. Its totient is φ = 114507030392820.
The previous prime is 114507053001527. The next prime is 114507053001533. The reversal of 114507053001529 is 925100350705411.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 114507053001529 - 21 = 114507053001527 is a prime.
It is a super-2 number, since 2×1145070530015292 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114507053001527) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 185632 + ... + 15134350.
It is an arithmetic number, because the mean of its divisors is an integer number (28626768902560).
Almost surely, 2114507053001529 is an apocalyptic number.
It is an amenable number.
114507053001529 is a deficient number, since it is larger than the sum of its proper divisors (22608711).
114507053001529 is an equidigital number, since it uses as much as digits as its factorization.
114507053001529 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22608710.
The product of its (nonzero) digits is 189000, while the sum is 43.
The spelling of 114507053001529 in words is "one hundred fourteen trillion, five hundred seven billion, fifty-three million, one thousand, five hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •