Base | Representation |
---|---|
bin | 100000000011110000010… |
… | …1010011101000110011111 |
3 | 120121012221102121222222111 |
4 | 1000013200222131012133 |
5 | 1034142203320012111 |
6 | 13212050031454451 |
7 | 633221350015561 |
oct | 100074052350637 |
9 | 16535842558874 |
10 | 4406110704031 |
11 | 1449691697393 |
12 | 5b1b25687427 |
13 | 25c65742347a |
14 | 113384ccb331 |
15 | 7992e0a7a21 |
hex | 401e0a9d19f |
4406110704031 has 16 divisors (see below), whose sum is σ = 4504619757600. Its totient is φ = 4308181637760.
The previous prime is 4406110704029. The next prime is 4406110704059. The reversal of 4406110704031 is 1304070116044.
It is a cyclic number.
It is not a de Polignac number, because 4406110704031 - 21 = 4406110704029 is a prime.
It is a super-2 number, since 2×44061107040312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4406110703984 and 4406110704002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4406110704631) 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 15 ways as a sum of consecutive naturals, for example, 44667841 + ... + 44766373.
It is an arithmetic number, because the mean of its divisors is an integer number (281538734850).
Almost surely, 24406110704031 is an apocalyptic number.
4406110704031 is a deficient number, since it is larger than the sum of its proper divisors (98509053569).
4406110704031 is a wasteful number, since it uses less digits than its factorization.
4406110704031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101466.
The product of its (nonzero) digits is 8064, while the sum is 31.
The spelling of 4406110704031 in words is "four trillion, four hundred six billion, one hundred ten million, seven hundred four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •