Base | Representation |
---|---|
bin | 110101001100010101… |
… | …0011111001010010101 |
3 | 101220211220200210102100 |
4 | 1222120222133022111 |
5 | 3332420442033323 |
6 | 124250550232313 |
7 | 11152510404513 |
oct | 1523052371225 |
9 | 356756623370 |
10 | 114230424213 |
11 | 44499107474 |
12 | 1a17b655699 |
13 | aa05a989b9 |
14 | 5758d994b3 |
15 | 2e886d6943 |
hex | 1a98a9f295 |
114230424213 has 12 divisors (see below), whose sum is σ = 165039516460. Its totient is φ = 76135147776.
The previous prime is 114230424169. The next prime is 114230424221. The reversal of 114230424213 is 312424032411.
114230424213 is a `hidden beast` number, since 1 + 1 + 4 + 23 + 0 + 424 + 213 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 26459251569 + 87771172644 = 162663^2 + 296262^2 .
It is not a de Polignac number, because 114230424213 - 29 = 114230423701 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 (114230424233) 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 11 ways as a sum of consecutive naturals, for example, 1499806 + ... + 1574127.
Almost surely, 2114230424213 is an apocalyptic number.
It is an amenable number.
114230424213 is a deficient number, since it is larger than the sum of its proper divisors (50809092247).
114230424213 is a wasteful number, since it uses less digits than its factorization.
114230424213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3078068 (or 3078065 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 114230424213 its reverse (312424032411), we get a palindrome (426654456624).
The spelling of 114230424213 in words is "one hundred fourteen billion, two hundred thirty million, four hundred twenty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •