Base | Representation |
---|---|
bin | 1101101000111… |
… | …11110010110011 |
3 | 21222022101121101 |
4 | 12310133302303 |
5 | 213243100021 |
6 | 15204305231 |
7 | 2556411421 |
oct | 664376263 |
9 | 258271541 |
10 | 114425011 |
11 | 59654228 |
12 | 323a2217 |
13 | 1a92450c |
14 | 112a8111 |
15 | a0a3a91 |
hex | 6d1fcb3 |
114425011 has 8 divisors (see below), whose sum is σ = 127532880. Its totient is φ = 102025728.
The previous prime is 114425009. The next prime is 114425029. The reversal of 114425011 is 110524411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 114425011 - 21 = 114425009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 114425011.
It is not an unprimeable number, because it can be changed into a prime (114425041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 176806 + ... + 177451.
It is an arithmetic number, because the mean of its divisors is an integer number (15941610).
Almost surely, 2114425011 is an apocalyptic number.
114425011 is a deficient number, since it is larger than the sum of its proper divisors (13107869).
114425011 is a wasteful number, since it uses less digits than its factorization.
114425011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 354293.
The product of its (nonzero) digits is 160, while the sum is 19.
The square root of 114425011 is about 10696.9626997573. The cubic root of 114425011 is about 485.4825833952.
Adding to 114425011 its reverse (110524411), we get a palindrome (224949422).
The spelling of 114425011 in words is "one hundred fourteen million, four hundred twenty-five thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •