Base | Representation |
---|---|
bin | 1110010010110… |
… | …11111000010000 |
3 | 22100122021002021 |
4 | 13021123320100 |
5 | 221144222000 |
6 | 15522101224 |
7 | 2654152333 |
oct | 711337020 |
9 | 270567067 |
10 | 119914000 |
11 | 61763188 |
12 | 341aa814 |
13 | 1bac6a3b |
14 | 11cd661a |
15 | a7da11a |
hex | 725be10 |
119914000 has 40 divisors (see below), whose sum is σ = 289956888. Its totient is φ = 47964800.
The previous prime is 119913991. The next prime is 119914007. The reversal of 119914000 is 419911.
It can be written as a sum of positive squares in 4 ways, for example, as 12418576 + 107495424 = 3524^2 + 10368^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a zygodrome in base 5.
It is not an unprimeable number, because it can be changed into a prime (119914007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27979 + ... + 31978.
Almost surely, 2119914000 is an apocalyptic number.
119914000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
119914000 is an abundant number, since it is smaller than the sum of its proper divisors (170042888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
119914000 is an equidigital number, since it uses as much as digits as its factorization.
119914000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59980 (or 59964 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 25.
The square root of 119914000 is about 10950.5251015648. The cubic root of 119914000 is about 493.1245565741.
The spelling of 119914000 in words is "one hundred nineteen million, nine hundred fourteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •