Base | Representation |
---|---|
bin | 100101010110001111… |
… | …100000111110010101 |
3 | 10211111202021000222000 |
4 | 211112033200332111 |
5 | 1124112003112321 |
6 | 30231124425513 |
7 | 2616520042650 |
oct | 452617407625 |
9 | 124452230860 |
10 | 40101613461 |
11 | 16009351808 |
12 | 7931b48299 |
13 | 3a2113c580 |
14 | 1d25c9c897 |
15 | 109a8a9826 |
hex | 9563e0f95 |
40101613461 has 32 divisors (see below), whose sum is σ = 73119755520. Its totient is φ = 21152498112.
The previous prime is 40101613451. The next prime is 40101613469. The reversal of 40101613461 is 16431610104.
40101613461 is a `hidden beast` number, since 4 + 0 + 1 + 0 + 1 + 613 + 46 + 1 = 666.
It is not a de Polignac number, because 40101613461 - 26 = 40101613397 is a prime.
It is a super-4 number, since 4×401016134614 (a number of 44 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40101613469) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8158230 + ... + 8163143.
It is an arithmetic number, because the mean of its divisors is an integer number (2284992360).
Almost surely, 240101613461 is an apocalyptic number.
It is an amenable number.
40101613461 is a deficient number, since it is larger than the sum of its proper divisors (33018142059).
40101613461 is a wasteful number, since it uses less digits than its factorization.
40101613461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16321402 (or 16321396 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The spelling of 40101613461 in words is "forty billion, one hundred one million, six hundred thirteen thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •