Base | Representation |
---|---|
bin | 1101100110100… |
… | …01000110100010 |
3 | 21221201000110120 |
4 | 12303101012202 |
5 | 213202241230 |
6 | 15153341110 |
7 | 2553566622 |
oct | 663210642 |
9 | 257630416 |
10 | 114102690 |
11 | 59454049 |
12 | 32267796 |
13 | 1a8408b0 |
14 | 11222882 |
15 | a03d310 |
hex | 6cd11a2 |
114102690 has 64 divisors (see below), whose sum is σ = 296182656. Its totient is φ = 27965952.
The previous prime is 114102689. The next prime is 114102719. The reversal of 114102690 is 96201411.
It is a super-2 number, since 2×1141026902 = 26038847730472200, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 114102690.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 119254 + ... + 120206.
It is an arithmetic number, because the mean of its divisors is an integer number (4627854).
Almost surely, 2114102690 is an apocalyptic number.
114102690 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 114102690, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (148091328).
114102690 is an abundant number, since it is smaller than the sum of its proper divisors (182079966).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114102690 is a wasteful number, since it uses less digits than its factorization.
114102690 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1283.
The product of its (nonzero) digits is 432, while the sum is 24.
The square root of 114102690 is about 10681.8860694168. The cubic root of 114102690 is about 485.0263067178.
The spelling of 114102690 in words is "one hundred fourteen million, one hundred two thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •