Base | Representation |
---|---|
bin | 110101011001110110… |
… | …1000001100111010000 |
3 | 101222000112022121112220 |
4 | 1222303231001213100 |
5 | 3334333110340243 |
6 | 124403553421040 |
7 | 11166656356116 |
oct | 1526355014720 |
9 | 358015277486 |
10 | 114684074448 |
11 | 44701196619 |
12 | 1a28756a780 |
13 | aa78a72ca8 |
14 | 579d327ab6 |
15 | 2eb3446783 |
hex | 1ab3b419d0 |
114684074448 has 160 divisors (see below), whose sum is σ = 307089868800. Its totient is φ = 36863589888.
The previous prime is 114684074447. The next prime is 114684074467. The reversal of 114684074448 is 844470486411.
It is a self number, because there is not a number n which added to its sum of digits gives 114684074448.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114684074441) 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, 31793061 + ... + 31796667.
It is an arithmetic number, because the mean of its divisors is an integer number (1919311680).
Almost surely, 2114684074448 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 114684074448, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (153544934400).
114684074448 is an abundant number, since it is smaller than the sum of its proper divisors (192405794352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114684074448 is a wasteful number, since it uses less digits than its factorization.
114684074448 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3889 (or 3883 counting only the distinct ones).
The product of its (nonzero) digits is 2752512, while the sum is 51.
The spelling of 114684074448 in words is "one hundred fourteen billion, six hundred eighty-four million, seventy-four thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •