Base | Representation |
---|---|
bin | 110101001000110011… |
… | …0111100100000011010 |
3 | 101220112122222000211100 |
4 | 1222101212330200122 |
5 | 3332200141232242 |
6 | 124231121212230 |
7 | 11146542315636 |
oct | 1522146744032 |
9 | 356478860740 |
10 | 114112055322 |
11 | 4443830a141 |
12 | 1a147a91076 |
13 | a9b73c3335 |
14 | 5747385dc6 |
15 | 2e7d10454c |
hex | 1a919bc81a |
114112055322 has 48 divisors (see below), whose sum is σ = 248045249088. Its totient is φ = 37914065280.
The previous prime is 114112055303. The next prime is 114112055329. The reversal of 114112055322 is 223550211411.
It is a happy number.
114112055322 is a `hidden beast` number, since 1 + 1 + 4 + 1 + 120 + 5 + 532 + 2 = 666.
It is a super-2 number, since 2×1141120553222 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (114112055329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9120523 + ... + 9133025.
It is an arithmetic number, because the mean of its divisors is an integer number (5167609356).
Almost surely, 2114112055322 is an apocalyptic number.
114112055322 is an abundant number, since it is smaller than the sum of its proper divisors (133933193766).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114112055322 is a wasteful number, since it uses less digits than its factorization.
114112055322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14115 (or 14112 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
Adding to 114112055322 its reverse (223550211411), we get a palindrome (337662266733).
The spelling of 114112055322 in words is "one hundred fourteen billion, one hundred twelve million, fifty-five thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •