Base | Representation |
---|---|
bin | 1101101000000… |
… | …00101010001001 |
3 | 21222001220200001 |
4 | 12310000222021 |
5 | 213230004411 |
6 | 15201443001 |
7 | 2555340544 |
oct | 664005211 |
9 | 258056601 |
10 | 114297481 |
11 | 59577431 |
12 | 32340461 |
13 | 1a8ab45c |
14 | 1127385b |
15 | a07adc1 |
hex | 6d00a89 |
114297481 has 3 divisors (see below), whose sum is σ = 114308173. Its totient is φ = 114286790.
The previous prime is 114297479. The next prime is 114297499. The reversal of 114297481 is 184792411.
The square root of 114297481 is 10691.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is not a de Polignac number, because 114297481 - 21 = 114297479 is a prime.
It is a super-2 number, since 2×1142974812 = 26127828325890722, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 114297481.
It is not an unprimeable number, because it can be changed into a prime (114297401) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 5346 + ... + 16036.
Almost surely, 2114297481 is an apocalyptic number.
114297481 is the 10691-st square number.
114297481 is the 5346-th centered octagonal number.
It is an amenable number.
114297481 is a deficient number, since it is larger than the sum of its proper divisors (10692).
114297481 is an frugal number, since it uses more digits than its factorization.
114297481 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21382 (or 10691 counting only the distinct ones).
The product of its digits is 16128, while the sum is 37.
The cubic root of 114297481 is about 485.3021548651.
The spelling of 114297481 in words is "one hundred fourteen million, two hundred ninety-seven thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •