Base | Representation |
---|---|
bin | 10010010111111001101001… |
… | …00111000001111000000111 |
3 | 12022001112212010210112121101 |
4 | 21023330310213001320013 |
5 | 20243433123320000012 |
6 | 221533102002200531 |
7 | 11340031602324454 |
oct | 1113746447017007 |
9 | 168045763715541 |
10 | 40403640000007 |
11 | 119680a6506339 |
12 | 46465b5353147 |
13 | 197107c07c75b |
14 | 9d9791c8082b |
15 | 4a0ed0e78d57 |
hex | 24bf349c1e07 |
40403640000007 has 2 divisors, whose sum is σ = 40403640000008. Its totient is φ = 40403640000006.
The previous prime is 40403639999951. The next prime is 40403640000019. The reversal of 40403640000007 is 70000004630404.
40403640000007 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 a de Polignac number, because none of the positive numbers 2k-40403640000007 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 40403640000007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40403640000107) 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, 20201820000003 + 20201820000004.
It is an arithmetic number, because the mean of its divisors is an integer number (20201820000004).
Almost surely, 240403640000007 is an apocalyptic number.
40403640000007 is a deficient number, since it is larger than the sum of its proper divisors (1).
40403640000007 is an equidigital number, since it uses as much as digits as its factorization.
40403640000007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 28.
The spelling of 40403640000007 in words is "forty trillion, four hundred three billion, six hundred forty million, seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •