Base | Representation |
---|---|
bin | 110110010101000011… |
… | …0010001111101000111 |
3 | 102011010221221201211121 |
4 | 1230222012101331013 |
5 | 3402420111001341 |
6 | 125333031414411 |
7 | 11300126043433 |
oct | 1545206217507 |
9 | 364127851747 |
10 | 116670406471 |
11 | 45530448233 |
12 | 1a740824407 |
13 | b004443098 |
14 | 590b0659c3 |
15 | 307ca094d1 |
hex | 1b2a191f47 |
116670406471 has 4 divisors (see below), whose sum is σ = 122810954200. Its totient is φ = 110529858744.
The previous prime is 116670406459. The next prime is 116670406477. The reversal of 116670406471 is 174604076611.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 116670406471 - 225 = 116636852039 is a prime.
It is a super-3 number, since 3×1166704064713 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is the 341571-st Hogben number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116670406477) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3070273836 + ... + 3070273873.
It is an arithmetic number, because the mean of its divisors is an integer number (30702738550).
Almost surely, 2116670406471 is an apocalyptic number.
116670406471 is a deficient number, since it is larger than the sum of its proper divisors (6140547729).
116670406471 is an equidigital number, since it uses as much as digits as its factorization.
116670406471 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6140547728.
The product of its (nonzero) digits is 169344, while the sum is 43.
The spelling of 116670406471 in words is "one hundred sixteen billion, six hundred seventy million, four hundred six thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •