Base | Representation |
---|---|
bin | 110101000101111000… |
… | …1010001101000100000 |
3 | 101220021211122101101110 |
4 | 1222023301101220200 |
5 | 3332000102200000 |
6 | 124213301503320 |
7 | 11144242600623 |
oct | 1521361215040 |
9 | 356254571343 |
10 | 114014100000 |
11 | 44397a94929 |
12 | 1a11b111b40 |
13 | a9a00173c8 |
14 | 5738367dba |
15 | 2e74705850 |
hex | 1a8bc51a20 |
114014100000 has 144 divisors (see below), whose sum is σ = 374085806976. Its totient is φ = 30403680000.
The previous prime is 114014099977. The next prime is 114014100017. The reversal of 114014100000 is 1410411.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 109977 + ... + 490023.
It is an arithmetic number, because the mean of its divisors is an integer number (2597818104).
Almost surely, 2114014100000 is an apocalyptic number.
114014100000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 114014100000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (187042903488).
114014100000 is an abundant number, since it is smaller than the sum of its proper divisors (260071706976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114014100000 is an frugal number, since it uses more digits than its factorization.
114014100000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 380085 (or 380057 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 114014100000 its reverse (1410411), we get a palindrome (114015510411).
The spelling of 114014100000 in words is "one hundred fourteen billion, fourteen million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •