Base | Representation |
---|---|
bin | 110101000101011110… |
… | …1010001001011010101 |
3 | 101220020212222201221101 |
4 | 1222022331101023111 |
5 | 3331433104413040 |
6 | 124212053350101 |
7 | 11144015656342 |
oct | 1521275211325 |
9 | 356225881841 |
10 | 114000466645 |
11 | 4439032299a |
12 | 1a116638331 |
13 | a99a252b30 |
14 | 57366197c9 |
15 | 2e7341109a |
hex | 1a8af512d5 |
114000466645 has 8 divisors (see below), whose sum is σ = 147323680056. Its totient is φ = 84184959936.
The previous prime is 114000466633. The next prime is 114000466661. The reversal of 114000466645 is 546664000411.
It can be written as a sum of positive squares in 4 ways, for example, as 15789681649 + 98210784996 = 125657^2 + 313386^2 .
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-114000466645 is a prime.
It is a super-2 number, since 2×1140004666452 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
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 in 7 ways as a sum of consecutive naturals, for example, 876926602 + ... + 876926731.
It is an arithmetic number, because the mean of its divisors is an integer number (18415460007).
Almost surely, 2114000466645 is an apocalyptic number.
It is an amenable number.
114000466645 is a deficient number, since it is larger than the sum of its proper divisors (33323213411).
114000466645 is a wasteful number, since it uses less digits than its factorization.
114000466645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1753853351.
The product of its (nonzero) digits is 69120, while the sum is 37.
The spelling of 114000466645 in words is "one hundred fourteen billion, four hundred sixty-six thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •