Base | Representation |
---|---|
bin | 10010100000000100011110… |
… | …00101011111011101100111 |
3 | 12100001101100222002001011002 |
4 | 21100002033011133131213 |
5 | 20313033002141343231 |
6 | 222310042404303515 |
7 | 11366226433665146 |
oct | 1120021705373547 |
9 | 170041328061132 |
10 | 40684330809191 |
11 | 11a661451157a3 |
12 | 4690a900a1b9b |
13 | 1991692675664 |
14 | a091bc76175d |
15 | 4a845d3760cb |
hex | 25008f15f767 |
40684330809191 has 2 divisors, whose sum is σ = 40684330809192. Its totient is φ = 40684330809190.
The previous prime is 40684330809169. The next prime is 40684330809193. The reversal of 40684330809191 is 19190803348604.
40684330809191 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 40684330809191 - 26 = 40684330809127 is a prime.
Together with 40684330809193, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40684330809193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20342165404595 + 20342165404596.
It is an arithmetic number, because the mean of its divisors is an integer number (20342165404596).
Almost surely, 240684330809191 is an apocalyptic number.
40684330809191 is a deficient number, since it is larger than the sum of its proper divisors (1).
40684330809191 is an equidigital number, since it uses as much as digits as its factorization.
40684330809191 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4478976, while the sum is 56.
The spelling of 40684330809191 in words is "forty trillion, six hundred eighty-four billion, three hundred thirty million, eight hundred nine thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •