Base | Representation |
---|---|
bin | 110101000101110100… |
… | …1101111011110010001 |
3 | 101220021200221001022000 |
4 | 1222023221233132101 |
5 | 3331444101000243 |
6 | 124213151304213 |
7 | 11144220034050 |
oct | 1521351573621 |
9 | 356250831260 |
10 | 114012125073 |
11 | 44396966060 |
12 | 1a11a51b069 |
13 | a99c7a5502 |
14 | 5737db2397 |
15 | 2e744655d3 |
hex | 1a8ba6f791 |
114012125073 has 32 divisors (see below), whose sum is σ = 210585169920. Its totient is φ = 59227076880.
The previous prime is 114012125069. The next prime is 114012125093. The reversal of 114012125073 is 370521210411.
114012125073 is a `hidden beast` number, since 1 + 1 + 401 + 2 + 1 + 250 + 7 + 3 = 666.
It is not a de Polignac number, because 114012125073 - 22 = 114012125069 is a prime.
It is a super-2 number, since 2×1140121250732 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (114012125093) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 27417865 + ... + 27422022.
It is an arithmetic number, because the mean of its divisors is an integer number (6580786560).
Almost surely, 2114012125073 is an apocalyptic number.
It is an amenable number.
114012125073 is a deficient number, since it is larger than the sum of its proper divisors (96573044847).
114012125073 is a wasteful number, since it uses less digits than its factorization.
114012125073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54839914 (or 54839908 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 27.
Adding to 114012125073 its reverse (370521210411), we get a palindrome (484533335484).
The spelling of 114012125073 in words is "one hundred fourteen billion, twelve million, one hundred twenty-five thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •