Base | Representation |
---|---|
bin | 110101001001011101… |
… | …0110001111101011101 |
3 | 101220121012022120110120 |
4 | 1222102322301331131 |
5 | 3332221303012341 |
6 | 124233224225153 |
7 | 11150230160346 |
oct | 1522272617535 |
9 | 356535276416 |
10 | 114134032221 |
11 | 4444975a770 |
12 | 1a15330b1b9 |
13 | a9bbb19511 |
14 | 574a2670cd |
15 | 2e7eee6066 |
hex | 1a92eb1f5d |
114134032221 has 32 divisors (see below), whose sum is σ = 173284254720. Its totient is φ = 66144355200.
The previous prime is 114134032219. The next prime is 114134032261. The reversal of 114134032221 is 122230431411.
It is not a de Polignac number, because 114134032221 - 21 = 114134032219 is a prime.
It is a super-2 number, since 2×1141340322212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 114134032191 and 114134032200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114134032211) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2657206 + ... + 2699816.
It is an arithmetic number, because the mean of its divisors is an integer number (5415132960).
Almost surely, 2114134032221 is an apocalyptic number.
114134032221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
114134032221 is a deficient number, since it is larger than the sum of its proper divisors (59150222499).
114134032221 is a wasteful number, since it uses less digits than its factorization.
114134032221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46177.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 114134032221 its reverse (122230431411), we get a palindrome (236364463632).
The spelling of 114134032221 in words is "one hundred fourteen billion, one hundred thirty-four million, thirty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •