Base | Representation |
---|---|
bin | 100000000011110000101… |
… | …0011000111001001010011 |
3 | 120121012222011200110222012 |
4 | 1000013201103013021103 |
5 | 1034142214032041003 |
6 | 13212051052133135 |
7 | 633221536425434 |
oct | 100074123071123 |
9 | 16535864613865 |
10 | 4406121362003 |
11 | 1449697706929 |
12 | 5b1b291671ab |
13 | 25c6596b566a |
14 | 1133864a348b |
15 | 7992eeb08d8 |
hex | 401e14c7253 |
4406121362003 has 16 divisors (see below), whose sum is σ = 4560350348736. Its totient is φ = 4254173045760.
The previous prime is 4406121361969. The next prime is 4406121362009. The reversal of 4406121362003 is 3002631216044.
It is a cyclic number.
It is not a de Polignac number, because 4406121362003 - 212 = 4406121357907 is a prime.
It is a super-3 number, since 3×44061213620033 (a number of 39 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4406121362009) 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 15 ways as a sum of consecutive naturals, for example, 6222401 + ... + 6894237.
It is an arithmetic number, because the mean of its divisors is an integer number (285021896796).
Almost surely, 24406121362003 is an apocalyptic number.
4406121362003 is a deficient number, since it is larger than the sum of its proper divisors (154228986733).
4406121362003 is a wasteful number, since it uses less digits than its factorization.
4406121362003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 673534.
The product of its (nonzero) digits is 20736, while the sum is 32.
Adding to 4406121362003 its reverse (3002631216044), we get a palindrome (7408752578047).
The spelling of 4406121362003 in words is "four trillion, four hundred six billion, one hundred twenty-one million, three hundred sixty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •