Base | Representation |
---|---|
bin | 10010011001101010100100… |
… | …01110111000110100101011 |
3 | 12022021100100022022101001112 |
4 | 21030311102032320310223 |
5 | 20300431304212430331 |
6 | 222021005531140535 |
7 | 11344306150325465 |
oct | 1114652216706453 |
9 | 168240308271045 |
10 | 40464266530091 |
11 | 11990887611758 |
12 | 46562b4ba474b |
13 | 19769c1563cb1 |
14 | 9dc6a3a25135 |
15 | 4a287d6da32b |
hex | 24cd523b8d2b |
40464266530091 has 2 divisors, whose sum is σ = 40464266530092. Its totient is φ = 40464266530090.
The previous prime is 40464266530087. The next prime is 40464266530169. The reversal of 40464266530091 is 19003566246404.
40464266530091 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 40464266530091 - 22 = 40464266530087 is a prime.
It is a super-3 number, since 3×404642665300913 (a number of 42 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (40464266530021) 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, 20232133265045 + 20232133265046.
It is an arithmetic number, because the mean of its divisors is an integer number (20232133265046).
Almost surely, 240464266530091 is an apocalyptic number.
40464266530091 is a deficient number, since it is larger than the sum of its proper divisors (1).
40464266530091 is an equidigital number, since it uses as much as digits as its factorization.
40464266530091 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3732480, while the sum is 50.
The spelling of 40464266530091 in words is "forty trillion, four hundred sixty-four billion, two hundred sixty-six million, five hundred thirty thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •