Base | Representation |
---|---|
bin | 1101101011000… |
… | …11101111000000 |
3 | 21222211112100020 |
4 | 12311203233000 |
5 | 213331001141 |
6 | 15214253440 |
7 | 2561650641 |
oct | 665435700 |
9 | 258745306 |
10 | 114703296 |
11 | 59824314 |
12 | 324b7280 |
13 | 1a9c1096 |
14 | 1133b6c8 |
15 | a10b266 |
hex | 6d63bc0 |
114703296 has 56 divisors (see below), whose sum is σ = 304702464. Its totient is φ = 38081280.
The previous prime is 114703283. The next prime is 114703313. The reversal of 114703296 is 692307411.
It is a super-2 number, since 2×1147032962 = 26313692226527232, which contains 22 as substring.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 53281 + ... + 55391.
Almost surely, 2114703296 is an apocalyptic number.
114703296 is a gapful number since it is divisible by the number (16) 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 114703296, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152351232).
114703296 is an abundant number, since it is smaller than the sum of its proper divisors (189999168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114703296 is a wasteful number, since it uses less digits than its factorization.
114703296 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2409 (or 2399 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 33.
The square root of 114703296 is about 10709.9624649202. The cubic root of 114703296 is about 485.8758340865.
The spelling of 114703296 in words is "one hundred fourteen million, seven hundred three thousand, two hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •