Base | Representation |
---|---|
bin | 110101000110111101… |
… | …0010011111011000111 |
3 | 101220101100020110122001 |
4 | 1222031322103323013 |
5 | 3332033301214421 |
6 | 124221023450131 |
7 | 11145160126003 |
oct | 1521572237307 |
9 | 356340213561 |
10 | 114050023111 |
11 | 444062a0452 |
12 | 1a12b156947 |
13 | a9a75b439b |
14 | 573d039703 |
15 | 2e7794e691 |
hex | 1a8de93ec7 |
114050023111 has 8 divisors (see below), whose sum is σ = 119020769280. Its totient is φ = 109080281112.
The previous prime is 114050023099. The next prime is 114050023123. The reversal of 114050023111 is 111320050411.
It is an interprime number because it is at equal distance from previous prime (114050023099) and next prime (114050023123).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114050023111 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114050023211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14175 + ... + 477808.
It is an arithmetic number, because the mean of its divisors is an integer number (14877596160).
Almost surely, 2114050023111 is an apocalyptic number.
114050023111 is a deficient number, since it is larger than the sum of its proper divisors (4970746169).
114050023111 is a wasteful number, since it uses less digits than its factorization.
114050023111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 502085.
The product of its (nonzero) digits is 120, while the sum is 19.
Adding to 114050023111 its reverse (111320050411), we get a palindrome (225370073522).
It can be divided in two parts, 1140500 and 23111, that added together give a palindrome (1163611).
The spelling of 114050023111 in words is "one hundred fourteen billion, fifty million, twenty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.850 sec. • engine limits •