Base | Representation |
---|---|
bin | 110101011011100001… |
… | …1011000001001001111 |
3 | 101222011110001102020212 |
4 | 1222313003120021033 |
5 | 3334442001444201 |
6 | 124413322033035 |
7 | 11201241110432 |
oct | 1526703301117 |
9 | 358143042225 |
10 | 114740265551 |
11 | 4472a98584a |
12 | 1a2a234877b |
13 | aa875b8372 |
14 | 57a6993819 |
15 | 2eb8345abb |
hex | 1ab70d824f |
114740265551 has 4 divisors (see below), whose sum is σ = 115316850000. Its totient is φ = 114163681104.
The previous prime is 114740265473. The next prime is 114740265571. The reversal of 114740265551 is 155562047411.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 155562047411 = 197 ⋅789655063.
It is a cyclic number.
It is not a de Polignac number, because 114740265551 - 218 = 114740003407 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 114740265499 and 114740265508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114740265571) 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, 288291926 + ... + 288292323.
It is an arithmetic number, because the mean of its divisors is an integer number (28829212500).
Almost surely, 2114740265551 is an apocalyptic number.
114740265551 is a deficient number, since it is larger than the sum of its proper divisors (576584449).
114740265551 is an equidigital number, since it uses as much as digits as its factorization.
114740265551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 576584448.
The product of its (nonzero) digits is 168000, while the sum is 41.
The spelling of 114740265551 in words is "one hundred fourteen billion, seven hundred forty million, two hundred sixty-five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •