Base | Representation |
---|---|
bin | 11010110001010110011000… |
… | …010111001101101011111011 |
3 | 120102212212210111221102202221 |
4 | 122301112120113031223323 |
5 | 110413030013121114301 |
6 | 1054225123032504511 |
7 | 33541320135116140 |
oct | 3261263027155373 |
9 | 512785714842687 |
10 | 117740494707451 |
11 | 34574510857200 |
12 | 11256a9154b137 |
13 | 5090b5b76a375 |
14 | 21109556243c7 |
15 | d92a79120da1 |
hex | 6b15985cdafb |
117740494707451 has 48 divisors (see below), whose sum is σ = 150740202191040. Its totient is φ = 90004087008000.
The previous prime is 117740494707413. The next prime is 117740494707503. The reversal of 117740494707451 is 154707494047711.
It is not a de Polignac number, because 117740494707451 - 27 = 117740494707323 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 117740494707451.
It is not an unprimeable number, because it can be changed into a prime (117740494708451) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3011205 + ... + 15638041.
It is an arithmetic number, because the mean of its divisors is an integer number (3140420878980).
Almost surely, 2117740494707451 is an apocalyptic number.
117740494707451 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
117740494707451 is a deficient number, since it is larger than the sum of its proper divisors (32999707483589).
117740494707451 is a wasteful number, since it uses less digits than its factorization.
117740494707451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12627076 (or 12627065 counting only the distinct ones).
The product of its (nonzero) digits is 27659520, while the sum is 61.
The spelling of 117740494707451 in words is "one hundred seventeen trillion, seven hundred forty billion, four hundred ninety-four million, seven hundred seven thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •