Base | Representation |
---|---|
bin | 10010001101111011111000… |
… | …10111010100000011000101 |
3 | 12020211211002010221100020221 |
4 | 21012331330113110003011 |
5 | 20222330413043043010 |
6 | 221111514344224341 |
7 | 11303221014243655 |
oct | 1106757427240305 |
9 | 166754063840227 |
10 | 40061246456005 |
11 | 11845974258a65 |
12 | 45b017a46b0b1 |
13 | 19479b4333388 |
14 | 9c6d90712365 |
15 | 497141ad4dda |
hex | 246f7c5d40c5 |
40061246456005 has 8 divisors (see below), whose sum is σ = 48368425169952. Its totient is φ = 31852377549648.
The previous prime is 40061246455969. The next prime is 40061246456069. The reversal of 40061246456005 is 50065464216004.
40061246456005 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 40061246456005 - 213 = 40061246447813 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 24577450999 + ... + 24577452628.
It is an arithmetic number, because the mean of its divisors is an integer number (6046053146244).
Almost surely, 240061246456005 is an apocalyptic number.
It is an amenable number.
40061246456005 is a deficient number, since it is larger than the sum of its proper divisors (8307178713947).
40061246456005 is a wasteful number, since it uses less digits than its factorization.
40061246456005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49154903795.
The product of its (nonzero) digits is 691200, while the sum is 43.
The spelling of 40061246456005 in words is "forty trillion, sixty-one billion, two hundred forty-six million, four hundred fifty-six thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •