Base | Representation |
---|---|
bin | 11010000010101000101011… |
… | …001011111000101110001110 |
3 | 120000111222210002111022202011 |
4 | 122002220223023320232032 |
5 | 110002431100021420332 |
6 | 1043330300452251434 |
7 | 33060354105136510 |
oct | 3202505313705616 |
9 | 500458702438664 |
10 | 114530322451342 |
11 | 335470452517a6 |
12 | 10a188b1310b7a |
13 | 4bba21733b955 |
14 | 203d423687bb0 |
15 | d392e33c0e47 |
hex | 682a2b2f8b8e |
114530322451342 has 16 divisors (see below), whose sum is σ = 200042180455392. Its totient is φ = 48158302701600.
The previous prime is 114530322451189. The next prime is 114530322451361. The reversal of 114530322451342 is 243154223035411.
114530322451342 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 114530322451295 and 114530322451304.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 77176766409 + ... + 77176767892.
It is an arithmetic number, because the mean of its divisors is an integer number (12502636278462).
Almost surely, 2114530322451342 is an apocalyptic number.
114530322451342 is a deficient number, since it is larger than the sum of its proper divisors (85511858004050).
114530322451342 is a wasteful number, since it uses less digits than its factorization.
114530322451342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154353534363.
The product of its (nonzero) digits is 345600, while the sum is 40.
Adding to 114530322451342 its reverse (243154223035411), we get a palindrome (357684545486753).
The spelling of 114530322451342 in words is "one hundred fourteen trillion, five hundred thirty billion, three hundred twenty-two million, four hundred fifty-one thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •