Base | Representation |
---|---|
bin | 110101001110110101… |
… | …0111101001100011111 |
3 | 101221001202202220020102 |
4 | 1222131222331030133 |
5 | 3333103443331221 |
6 | 124303151011315 |
7 | 11154550436141 |
oct | 1523552751437 |
9 | 357052686212 |
10 | 114314433311 |
11 | 44531576781 |
12 | 1a1a3809b3b |
13 | aa1a300b20 |
14 | 57661c6c91 |
15 | 2e90c7d30b |
hex | 1a9dabd31f |
114314433311 has 8 divisors (see below), whose sum is σ = 124841765664. Its totient is φ = 104034803040.
The previous prime is 114314433251. The next prime is 114314433347. The reversal of 114314433311 is 113334413411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 114314433311 - 234 = 97134564127 is a prime.
It is a super-3 number, since 3×1143144333113 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114314433011) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 61924556 + ... + 61926401.
It is an arithmetic number, because the mean of its divisors is an integer number (15605220708).
Almost surely, 2114314433311 is an apocalyptic number.
114314433311 is a deficient number, since it is larger than the sum of its proper divisors (10527332353).
114314433311 is a wasteful number, since it uses less digits than its factorization.
114314433311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123851041.
The product of its digits is 5184, while the sum is 29.
Adding to 114314433311 its reverse (113334413411), we get a palindrome (227648846722).
The spelling of 114314433311 in words is "one hundred fourteen billion, three hundred fourteen million, four hundred thirty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •