Base | Representation |
---|---|
bin | 110101010010000011… |
… | …0011111000011110011 |
3 | 101221100021202202121222 |
4 | 1222210012133003303 |
5 | 3333314103010303 |
6 | 124322003135255 |
7 | 11160330420602 |
oct | 1524406370363 |
9 | 357307682558 |
10 | 114422313203 |
11 | 4458745a510 |
12 | 1a21397452b |
13 | aa36773193 |
14 | 5776669a39 |
15 | 2e9a48c938 |
hex | 1aa419f0f3 |
114422313203 has 8 divisors (see below), whose sum is σ = 129128629680. Its totient is φ = 100433378080.
The previous prime is 114422313199. The next prime is 114422313223. The reversal of 114422313203 is 302313224411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 114422313203 - 22 = 114422313199 is a prime.
It is a super-3 number, since 3×1144223132033 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114422313223) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 179345000 + ... + 179345637.
It is an arithmetic number, because the mean of its divisors is an integer number (16141078710).
Almost surely, 2114422313203 is an apocalyptic number.
114422313203 is a deficient number, since it is larger than the sum of its proper divisors (14706316477).
114422313203 is a wasteful number, since it uses less digits than its factorization.
114422313203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 358690677.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 114422313203 its reverse (302313224411), we get a palindrome (416735537614).
The spelling of 114422313203 in words is "one hundred fourteen billion, four hundred twenty-two million, three hundred thirteen thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •