Base | Representation |
---|---|
bin | 10010001111010011101111… |
… | …00100101000000100101111 |
3 | 12021000022211002210012001112 |
4 | 21013221313210220010233 |
5 | 20224114011114400304 |
6 | 221145314405502235 |
7 | 11306510543560511 |
oct | 1107516744500457 |
9 | 167008732705045 |
10 | 40108410700079 |
11 | 11863977241677 |
12 | 45b934171197b |
13 | 194c28c736cc7 |
14 | 9c9386591bb1 |
15 | 4984a252ab6e |
hex | 247a7792812f |
40108410700079 has 2 divisors, whose sum is σ = 40108410700080. Its totient is φ = 40108410700078.
The previous prime is 40108410700051. The next prime is 40108410700097. The reversal of 40108410700079 is 97000701480104.
40108410700079 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with next prime (40108410700097) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 40108410700079 - 28 = 40108410699823 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40108410700879) 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, 20054205350039 + 20054205350040.
It is an arithmetic number, because the mean of its divisors is an integer number (20054205350040).
Almost surely, 240108410700079 is an apocalyptic number.
40108410700079 is a deficient number, since it is larger than the sum of its proper divisors (1).
40108410700079 is an equidigital number, since it uses as much as digits as its factorization.
40108410700079 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56448, while the sum is 41.
The spelling of 40108410700079 in words is "forty trillion, one hundred eight billion, four hundred ten million, seven hundred thousand, seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •