Base | Representation |
---|---|
bin | 11010000010010011101001… |
… | …111110000101000101001101 |
3 | 120000102211112012222121102102 |
4 | 122002103221332011011031 |
5 | 110002043334342221204 |
6 | 1043312045153004445 |
7 | 33055624610050025 |
oct | 3202235176050515 |
9 | 500384465877372 |
10 | 114507753476429 |
11 | 33538513698915 |
12 | 10a14452b53725 |
13 | 4bb805b664821 |
14 | 203c2c2118a85 |
15 | d38921d5241e |
hex | 6824e9f8514d |
114507753476429 has 2 divisors, whose sum is σ = 114507753476430. Its totient is φ = 114507753476428.
The previous prime is 114507753476393. The next prime is 114507753476437. The reversal of 114507753476429 is 924674357705411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 114208656054025 + 299097422404 = 10686845^2 + 546898^2 .
It is a cyclic number.
It is not a de Polignac number, because 114507753476429 - 232 = 114503458509133 is a prime.
It is a super-2 number, since 2×1145077534764292 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114507753476729) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57253876738214 + 57253876738215.
It is an arithmetic number, because the mean of its divisors is an integer number (57253876738215).
Almost surely, 2114507753476429 is an apocalyptic number.
It is an amenable number.
114507753476429 is a deficient number, since it is larger than the sum of its proper divisors (1).
114507753476429 is an equidigital number, since it uses as much as digits as its factorization.
114507753476429 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 177811200, while the sum is 65.
The spelling of 114507753476429 in words is "one hundred fourteen trillion, five hundred seven billion, seven hundred fifty-three million, four hundred seventy-six thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •