Base | Representation |
---|---|
bin | 1101101101000… |
… | …01010000001000 |
3 | 22000022022222200 |
4 | 12312201100020 |
5 | 213412032042 |
6 | 15223520200 |
7 | 2564050365 |
oct | 666412010 |
9 | 260268880 |
10 | 114955272 |
11 | 59986663 |
12 | 325b9060 |
13 | 1aa7b993 |
14 | 113a546c |
15 | a15ac4c |
hex | 6da1408 |
114955272 has 48 divisors (see below), whose sum is σ = 313092780. Its totient is φ = 38102400.
The previous prime is 114955259. The next prime is 114955273. The reversal of 114955272 is 272559411.
It can be written as a sum of positive squares in 2 ways, for example, as 106626276 + 8328996 = 10326^2 + 2886^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (114955273) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8622 + ... + 17442.
Almost surely, 2114955272 is an apocalyptic number.
114955272 is a gapful number since it is divisible by the number (12) 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 114955272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (156546390).
114955272 is an abundant number, since it is smaller than the sum of its proper divisors (198137508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114955272 is a wasteful number, since it uses less digits than its factorization.
114955272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9014 (or 9007 counting only the distinct ones).
The product of its digits is 25200, while the sum is 36.
The square root of 114955272 is about 10721.7196381924. The cubic root of 114955272 is about 486.2313586252.
The spelling of 114955272 in words is "one hundred fourteen million, nine hundred fifty-five thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •