Base | Representation |
---|---|
bin | 10010001111010000111101… |
… | …10110001010000000000000 |
3 | 12021000011222100202122112220 |
4 | 21013220132312022000000 |
5 | 20224102434030421024 |
6 | 221144510552251040 |
7 | 11306425630100433 |
oct | 1107503666120000 |
9 | 167004870678486 |
10 | 40106922123264 |
11 | 11863282a538a7 |
12 | 45b8ba70a0a80 |
13 | 194c0b3214319 |
14 | 9c92849c381a |
15 | 4984169dae79 |
hex | 247a1ed8a000 |
40106922123264 has 112 divisors (see below), whose sum is σ = 106961663302560. Its totient is φ = 13366924083200.
The previous prime is 40106922123251. The next prime is 40106922123269. The reversal of 40106922123264 is 46232122960104.
It is not an unprimeable number, because it can be changed into a prime (40106922123269) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 164562007 + ... + 164805545.
Almost surely, 240106922123264 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40106922123264, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (53480831651280).
40106922123264 is an abundant number, since it is smaller than the sum of its proper divisors (66854741179296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40106922123264 is an equidigital number, since it uses as much as digits as its factorization.
40106922123264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250269 (or 250245 counting only the distinct ones).
The product of its (nonzero) digits is 248832, while the sum is 42.
The spelling of 40106922123264 in words is "forty trillion, one hundred six billion, nine hundred twenty-two million, one hundred twenty-three thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •