Base | Representation |
---|---|
bin | 1101100111110… |
… | …00010010111010 |
3 | 21222000011200100 |
4 | 12303320102322 |
5 | 213222410401 |
6 | 15201020230 |
7 | 2555135640 |
oct | 663702272 |
9 | 258004610 |
10 | 114263226 |
11 | 59553720 |
12 | 32324676 |
13 | 1a89899c |
14 | 11265190 |
15 | a070b86 |
hex | 6cf84ba |
114263226 has 96 divisors (see below), whose sum is σ = 324979200. Its totient is φ = 28110240.
The previous prime is 114263221. The next prime is 114263257. The reversal of 114263226 is 622362411.
114263226 is a `hidden beast` number, since 1 + 1 + 4 + 2 + 632 + 26 = 666.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 114263226.
It is not an unprimeable number, because it can be changed into a prime (114263221) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 24165 + ... + 28503.
It is an arithmetic number, because the mean of its divisors is an integer number (3385200).
Almost surely, 2114263226 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 114263226, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (162489600).
114263226 is an abundant number, since it is smaller than the sum of its proper divisors (210715974).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114263226 is a wasteful number, since it uses less digits than its factorization.
114263226 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4384 (or 4381 counting only the distinct ones).
The product of its digits is 3456, while the sum is 27.
The square root of 114263226 is about 10689.3978314964. The cubic root of 114263226 is about 485.2536682721.
The spelling of 114263226 in words is "one hundred fourteen million, two hundred sixty-three thousand, two hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •