Base | Representation |
---|---|
bin | 10010001111111110010001… |
… | …01001000111010011000011 |
3 | 12021002111202111210201112111 |
4 | 21013333020221013103003 |
5 | 20230002242342330043 |
6 | 221204012330240151 |
7 | 11311246451600563 |
oct | 1107771051072303 |
9 | 167074674721474 |
10 | 40131245667523 |
11 | 11872624a6169a |
12 | 4601854b86057 |
13 | 195148b562b6a |
14 | 9ca5111a0da3 |
15 | 498d8c0dc09d |
hex | 247fc8a474c3 |
40131245667523 has 2 divisors, whose sum is σ = 40131245667524. Its totient is φ = 40131245667522.
The previous prime is 40131245667503. The next prime is 40131245667547. The reversal of 40131245667523 is 32576654213104.
40131245667523 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 40131245667523 - 233 = 40122655732931 is a prime.
It is a super-2 number, since 2×401312456675232 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (40131245667503) 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, 20065622833761 + 20065622833762.
It is an arithmetic number, because the mean of its divisors is an integer number (20065622833762).
Almost surely, 240131245667523 is an apocalyptic number.
40131245667523 is a deficient number, since it is larger than the sum of its proper divisors (1).
40131245667523 is an equidigital number, since it uses as much as digits as its factorization.
40131245667523 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3628800, while the sum is 49.
The spelling of 40131245667523 in words is "forty trillion, one hundred thirty-one billion, two hundred forty-five million, six hundred sixty-seven thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •