Base | Representation |
---|---|
bin | 1101101000011… |
… | …10010011001000 |
3 | 21222011202022100 |
4 | 12310032103020 |
5 | 213233301402 |
6 | 15202553400 |
7 | 2555662461 |
oct | 664162310 |
9 | 258152270 |
10 | 114353352 |
11 | 59605403 |
12 | 32368860 |
13 | 1a8caa09 |
14 | 11289d68 |
15 | a08c71c |
hex | 6d0e4c8 |
114353352 has 48 divisors (see below), whose sum is σ = 311994540. Its totient is φ = 37836288.
The previous prime is 114353321. The next prime is 114353363. The reversal of 114353352 is 253353411.
It can be written as a sum of positive squares in 2 ways, for example, as 102697956 + 11655396 = 10134^2 + 3414^2 .
It is a super-2 number, since 2×1143533522 = 26153378227271808, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4068 + ... + 15660.
Almost surely, 2114353352 is an apocalyptic number.
114353352 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 114353352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (155997270).
114353352 is an abundant number, since it is smaller than the sum of its proper divisors (197641188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114353352 is a wasteful number, since it uses less digits than its factorization.
114353352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11742 (or 11735 counting only the distinct ones).
The product of its digits is 5400, while the sum is 27.
The square root of 114353352 is about 10693.6126729932. The cubic root of 114353352 is about 485.3812172663.
The spelling of 114353352 in words is "one hundred fourteen million, three hundred fifty-three thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •