Base | Representation |
---|---|
bin | 11010000010100001111111… |
… | …001001101000000000011110 |
3 | 120000111022020121201110202212 |
4 | 122002201333021220000132 |
5 | 110002321343122211032 |
6 | 1043323112121320422 |
7 | 33060011125452320 |
oct | 3202417711500036 |
9 | 500438217643685 |
10 | 114523141210142 |
11 | 33543a9a667a15 |
12 | 10a17428336112 |
13 | 4bb9641618bc2 |
14 | 203cd41a2d610 |
15 | d39022c05bb2 |
hex | 68287f26801e |
114523141210142 has 8 divisors (see below), whose sum is σ = 196325384931696. Its totient is φ = 49081346232912.
The previous prime is 114523141210087. The next prime is 114523141210199. The reversal of 114523141210142 is 241012141325411.
It is a happy number.
114523141210142 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 114523141210099 and 114523141210108.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4090112186063 + ... + 4090112186090.
It is an arithmetic number, because the mean of its divisors is an integer number (24540673116462).
Almost surely, 2114523141210142 is an apocalyptic number.
114523141210142 is a deficient number, since it is larger than the sum of its proper divisors (81802243721554).
114523141210142 is an equidigital number, since it uses as much as digits as its factorization.
114523141210142 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8180224372162.
The product of its (nonzero) digits is 7680, while the sum is 32.
Adding to 114523141210142 its reverse (241012141325411), we get a palindrome (355535282535553).
The spelling of 114523141210142 in words is "one hundred fourteen trillion, five hundred twenty-three billion, one hundred forty-one million, two hundred ten thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •