Base | Representation |
---|---|
bin | 11001111110011100001010… |
… | …100110100111101100100110 |
3 | 112222111102121022101211101112 |
4 | 121332130022212213230212 |
5 | 104433220120312040114 |
6 | 1042550020052225022 |
7 | 33030466403225564 |
oct | 3176341246475446 |
9 | 488442538354345 |
10 | 114242013002534 |
11 | 3344584706965a |
12 | 10990a4b00b172 |
13 | 4b98c8b519071 |
14 | 202d4b3010a34 |
15 | d31a6c20913e |
hex | 67e70a9a7b26 |
114242013002534 has 8 divisors (see below), whose sum is σ = 171363067873200. Its totient is φ = 57120990378136.
The previous prime is 114242013002527. The next prime is 114242013002539. The reversal of 114242013002534 is 435200310242411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1142420130025342 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 114242013002534.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114242013002539) 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, 5079932 + ... + 15946464.
It is an arithmetic number, because the mean of its divisors is an integer number (21420383484150).
Almost surely, 2114242013002534 is an apocalyptic number.
114242013002534 is a deficient number, since it is larger than the sum of its proper divisors (57121054870666).
114242013002534 is a wasteful number, since it uses less digits than its factorization.
114242013002534 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16123134.
The product of its (nonzero) digits is 23040, while the sum is 32.
Adding to 114242013002534 its reverse (435200310242411), we get a palindrome (549442323244945).
The spelling of 114242013002534 in words is "one hundred fourteen trillion, two hundred forty-two billion, thirteen million, two thousand, five hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •