Base | Representation |
---|---|
bin | 110101001100101111… |
… | …0101100101011111110 |
3 | 101220212212110011022011 |
4 | 1222121132230223332 |
5 | 3332432443023402 |
6 | 124252155441434 |
7 | 11153034631132 |
oct | 1523136545376 |
9 | 356785404264 |
10 | 114244111102 |
11 | 444a5905650 |
12 | 1a18415627a |
13 | aa0887b754 |
14 | 575ab1d3c2 |
15 | 2e899dbed7 |
hex | 1a997acafe |
114244111102 has 8 divisors (see below), whose sum is σ = 186944909112. Its totient is φ = 51929141400.
The previous prime is 114244111063. The next prime is 114244111133. The reversal of 114244111102 is 201111442411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1142441111022 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 5192914141 = 114244111102 / (1 + 1 + 4 + 2 + 4 + 4 + 1 + 1 + 1 + 1 + 0 + 2).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2596457049 + ... + 2596457092.
It is an arithmetic number, because the mean of its divisors is an integer number (23368113639).
Almost surely, 2114244111102 is an apocalyptic number.
114244111102 is a deficient number, since it is larger than the sum of its proper divisors (72700798010).
114244111102 is a wasteful number, since it uses less digits than its factorization.
114244111102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5192914154.
The product of its (nonzero) digits is 256, while the sum is 22.
Adding to 114244111102 its reverse (201111442411), we get a palindrome (315355553513).
The spelling of 114244111102 in words is "one hundred fourteen billion, two hundred forty-four million, one hundred eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •