Base | Representation |
---|---|
bin | 110101010010000101… |
… | …0010111110010110110 |
3 | 101221100100200112012000 |
4 | 1222210022113302312 |
5 | 3333314333111042 |
6 | 124322041040130 |
7 | 11160342163116 |
oct | 1524412276266 |
9 | 357310615160 |
10 | 114423332022 |
11 | 44587a95a0a |
12 | 1a214186046 |
13 | aa36a3bb2c |
14 | 5776853046 |
15 | 2e9a5de74c |
hex | 1aa4297cb6 |
114423332022 has 32 divisors (see below), whose sum is σ = 254286021600. Its totient is φ = 38139318144.
The previous prime is 114423331999. The next prime is 114423332053. The reversal of 114423332022 is 220233324411.
114423332022 is a `hidden beast` number, since 1 + 1 + 4 + 423 + 33 + 202 + 2 = 666.
It is a super-2 number, since 2×1144233320222 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1629298 + ... + 1698074.
It is an arithmetic number, because the mean of its divisors is an integer number (7946438175).
Almost surely, 2114423332022 is an apocalyptic number.
114423332022 is an abundant number, since it is smaller than the sum of its proper divisors (139862689578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114423332022 is a wasteful number, since it uses less digits than its factorization.
114423332022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99597 (or 99591 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 114423332022 its reverse (220233324411), we get a palindrome (334656656433).
The spelling of 114423332022 in words is "one hundred fourteen billion, four hundred twenty-three million, three hundred thirty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •