Base | Representation |
---|---|
bin | 10010011000011010011000… |
… | …00110101100000011110001 |
3 | 12022010020012220110111101111 |
4 | 21030031030012230003301 |
5 | 20244230121243410101 |
6 | 221545125511033321 |
7 | 11341223236252501 |
oct | 1114151406540361 |
9 | 168106186414344 |
10 | 40421214044401 |
11 | 119745a4604a73 |
12 | 4649a9a96b841 |
13 | 197291cc815a8 |
14 | 9da57bcaba01 |
15 | 4a16adc43251 |
hex | 24c34c1ac0f1 |
40421214044401 has 8 divisors (see below), whose sum is σ = 42182212699584. Its totient is φ = 38660511603120.
The previous prime is 40421214044377. The next prime is 40421214044437. The reversal of 40421214044401 is 10444041212404.
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 40421214044401 - 25 = 40421214044369 is a prime.
It is not an unprimeable number, because it can be changed into a prime (40421214044441) 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 7 ways as a sum of consecutive naturals, for example, 73774590 + ... + 74320471.
It is an arithmetic number, because the mean of its divisors is an integer number (5272776587448).
Almost surely, 240421214044401 is an apocalyptic number.
It is an amenable number.
40421214044401 is a deficient number, since it is larger than the sum of its proper divisors (1760998655183).
40421214044401 is a wasteful number, since it uses less digits than its factorization.
40421214044401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148106951.
The product of its (nonzero) digits is 16384, while the sum is 31.
Adding to 40421214044401 its reverse (10444041212404), we get a palindrome (50865255256805).
The spelling of 40421214044401 in words is "forty trillion, four hundred twenty-one billion, two hundred fourteen million, forty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •