Base | Representation |
---|---|
bin | 110101000110011001… |
… | …0101010101111100100 |
3 | 101220100000220022002012 |
4 | 1222030302222233210 |
5 | 3332013444222322 |
6 | 124215113133352 |
7 | 11144541365126 |
oct | 1521462525744 |
9 | 356300808065 |
10 | 114031242212 |
11 | 443a6733048 |
12 | 1a1249ba258 |
13 | a9a3739b24 |
14 | 573a74b216 |
15 | 2e75e8eae2 |
hex | 1a8ccaabe4 |
114031242212 has 6 divisors (see below), whose sum is σ = 199554673878. Its totient is φ = 57015621104.
The previous prime is 114031242191. The next prime is 114031242233. The reversal of 114031242212 is 212242130411.
It is an interprime number because it is at equal distance from previous prime (114031242191) and next prime (114031242233).
It can be written as a sum of positive squares in only one way, i.e., 106802161636 + 7229080576 = 326806^2 + 85024^2 .
It is a super-5 number, since 5×1140312422125 (a number of 56 digits) contains 55555 as substring.
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 as a sum of consecutive naturals, namely, 14253905273 + ... + 14253905280.
It is an arithmetic number, because the mean of its divisors is an integer number (33259112313).
Almost surely, 2114031242212 is an apocalyptic number.
It is an amenable number.
114031242212 is a deficient number, since it is larger than the sum of its proper divisors (85523431666).
114031242212 is a wasteful number, since it uses less digits than its factorization.
114031242212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28507810557 (or 28507810555 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 114031242212 its reverse (212242130411), we get a palindrome (326273372623).
The spelling of 114031242212 in words is "one hundred fourteen billion, thirty-one million, two hundred forty-two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.176 sec. • engine limits •