Base | Representation |
---|---|
bin | 10010001111100100001100… |
… | …01111110001000010101111 |
3 | 12021001011121220111211012112 |
4 | 21013302012033301002233 |
5 | 20224240110141341443 |
6 | 221153335254354235 |
7 | 11310242526441533 |
oct | 1107620617610257 |
9 | 167034556454175 |
10 | 40117246824623 |
11 | 118676a0a83841 |
12 | 45baba895b97b |
13 | 195006a26a877 |
14 | 9c9983d09bc3 |
15 | 49881d136b18 |
hex | 247c863f10af |
40117246824623 has 16 divisors (see below), whose sum is σ = 41416910976960. Its totient is φ = 38828939175936.
The previous prime is 40117246824583. The next prime is 40117246824637. The reversal of 40117246824623 is 32642864271104.
40117246824623 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 40117246824623 - 222 = 40117242630319 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40117246824643) 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 in 15 ways as a sum of consecutive naturals, for example, 167758286 + ... + 167997252.
It is an arithmetic number, because the mean of its divisors is an integer number (2588556936060).
Almost surely, 240117246824623 is an apocalyptic number.
40117246824623 is a deficient number, since it is larger than the sum of its proper divisors (1299664152337).
40117246824623 is a wasteful number, since it uses less digits than its factorization.
40117246824623 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 262706.
The product of its (nonzero) digits is 3096576, while the sum is 50.
The spelling of 40117246824623 in words is "forty trillion, one hundred seventeen billion, two hundred forty-six million, eight hundred twenty-four thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •