Base | Representation |
---|---|
bin | 11001111110010001010000… |
… | …011101001001010100100100 |
3 | 112222110022101000100202210121 |
4 | 121332101100131021110210 |
5 | 104433022123301201202 |
6 | 1042540401514331324 |
7 | 33026603215436464 |
oct | 3176212035112444 |
9 | 488408330322717 |
10 | 114230300022052 |
11 | 33440886425aa5 |
12 | 1098a720429b44 |
13 | 4b97b42988c96 |
14 | 202cac1587ba4 |
15 | d315d3c81537 |
hex | 67e450749524 |
114230300022052 has 48 divisors (see below), whose sum is σ = 206183513733120. Its totient is φ = 55342003272192.
The previous prime is 114230300022043. The next prime is 114230300022053. The reversal of 114230300022052 is 250220003032411.
114230300022052 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1142303000220522 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (114230300022053) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 218987724 + ... + 219508732.
It is an arithmetic number, because the mean of its divisors is an integer number (4295489869440).
Almost surely, 2114230300022052 is an apocalyptic number.
It is an amenable number.
114230300022052 is a deficient number, since it is larger than the sum of its proper divisors (91953213711068).
114230300022052 is a wasteful number, since it uses less digits than its factorization.
114230300022052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 531220 (or 531218 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 25.
Adding to 114230300022052 its reverse (250220003032411), we get a palindrome (364450303054463).
The spelling of 114230300022052 in words is "one hundred fourteen trillion, two hundred thirty billion, three hundred million, twenty-two thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •