Base | Representation |
---|---|
bin | 110101001110011100… |
… | …0000110110001110110 |
3 | 101221000211200122210102 |
4 | 1222130320012301312 |
5 | 3333042040300342 |
6 | 124301553154102 |
7 | 11154326226665 |
oct | 1523470066166 |
9 | 357024618712 |
10 | 114301103222 |
11 | 44524aa1679 |
12 | 1a19b25b932 |
13 | aa176145b7 |
14 | 5764516ddc |
15 | 2e8e9e8832 |
hex | 1a9ce06c76 |
114301103222 has 32 divisors (see below), whose sum is σ = 191332346880. Its totient is φ = 50979961440.
The previous prime is 114301103221. The next prime is 114301103243. The reversal of 114301103222 is 222301103411.
114301103222 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-3 number, since 3×1143011032223 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 114301103194 and 114301103203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114301103221) 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 15 ways as a sum of consecutive naturals, for example, 1267628 + ... + 1354799.
It is an arithmetic number, because the mean of its divisors is an integer number (5979135840).
Almost surely, 2114301103222 is an apocalyptic number.
114301103222 is a deficient number, since it is larger than the sum of its proper divisors (77031243658).
114301103222 is a wasteful number, since it uses less digits than its factorization.
114301103222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2622516.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 114301103222 its reverse (222301103411), we get a palindrome (336602206633).
The spelling of 114301103222 in words is "one hundred fourteen billion, three hundred one million, one hundred three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •