Base | Representation |
---|---|
bin | 110101000111010110… |
… | …1111010111010101110 |
3 | 101220102021200211000110 |
4 | 1222032231322322232 |
5 | 3332100232132144 |
6 | 124222225440450 |
7 | 11145413124225 |
oct | 1521655727256 |
9 | 356367624013 |
10 | 114063552174 |
11 | 444129a0aa0 |
12 | 1a1337a0126 |
13 | a9aa340350 |
14 | 5740b5bcbc |
15 | 2e78c230b9 |
hex | 1a8eb7aeae |
114063552174 has 64 divisors (see below), whose sum is σ = 268218720000. Its totient is φ = 31880977920.
The previous prime is 114063552167. The next prime is 114063552179. The reversal of 114063552174 is 471255360411.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114063552179) 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 31 ways as a sum of consecutive naturals, for example, 1061577 + ... + 1164075.
It is an arithmetic number, because the mean of its divisors is an integer number (4190917500).
Almost surely, 2114063552174 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 114063552174, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (134109360000).
114063552174 is an abundant number, since it is smaller than the sum of its proper divisors (154155167826).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114063552174 is a wasteful number, since it uses less digits than its factorization.
114063552174 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103825.
The product of its (nonzero) digits is 100800, while the sum is 39.
The spelling of 114063552174 in words is "one hundred fourteen billion, sixty-three million, five hundred fifty-two thousand, one hundred seventy-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •