Base | Representation |
---|---|
bin | 110110101011001111… |
… | …1011001111100001001 |
3 | 102020001212101200011011 |
4 | 1231112133121330021 |
5 | 3410431242042111 |
6 | 125534555003521 |
7 | 11324441436004 |
oct | 1552637317411 |
9 | 366055350134 |
10 | 117415190281 |
11 | 458828a5344 |
12 | 1a90a1395a1 |
13 | b0c283256c |
14 | 597bd3a53b |
15 | 30c30c6021 |
hex | 1b567d9f09 |
117415190281 has 3 divisors (see below), whose sum is σ = 117415532941. Its totient is φ = 117414847622.
The previous prime is 117415190267. The next prime is 117415190311. The reversal of 117415190281 is 182091514711.
The square root of 117415190281 is 342659.
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 117415190281 - 219 = 117414665993 is a prime.
It is a super-2 number, since 2×1174151902812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (117415190201) 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, 171330 + ... + 513988.
Almost surely, 2117415190281 is an apocalyptic number.
117415190281 is the 342659-th square number.
117415190281 is the 171330-th centered octagonal number.
It is an amenable number.
117415190281 is a deficient number, since it is larger than the sum of its proper divisors (342660).
117415190281 is an frugal number, since it uses more digits than its factorization.
117415190281 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 685318 (or 342659 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 40.
The spelling of 117415190281 in words is "one hundred seventeen billion, four hundred fifteen million, one hundred ninety thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •