Base | Representation |
---|---|
bin | 10010010010100100100111… |
… | …11010000000001011110001 |
3 | 12021102001021122110211200102 |
4 | 21021102103322000023301 |
5 | 20232433144113344401 |
6 | 221313022404002145 |
7 | 11320560565331015 |
oct | 1111222372001361 |
9 | 167361248424612 |
10 | 40220555215601 |
11 | 118a7494964a62 |
12 | 461701a690355 |
13 | 1959a223099b7 |
14 | 9d09844cc545 |
15 | 49b367a3056b |
hex | 249493e802f1 |
40220555215601 has 4 divisors (see below), whose sum is σ = 40330148009472. Its totient is φ = 40110962421732.
The previous prime is 40220555215583. The next prime is 40220555215657. The reversal of 40220555215601 is 10651255502204.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 40220555215601 - 238 = 39945677308657 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40220555215661) 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 3 ways as a sum of consecutive naturals, for example, 54796396385 + ... + 54796397118.
It is an arithmetic number, because the mean of its divisors is an integer number (10082537002368).
Almost surely, 240220555215601 is an apocalyptic number.
It is an amenable number.
40220555215601 is a deficient number, since it is larger than the sum of its proper divisors (109592793871).
40220555215601 is a wasteful number, since it uses less digits than its factorization.
40220555215601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109592793870.
The product of its (nonzero) digits is 120000, while the sum is 38.
The spelling of 40220555215601 in words is "forty trillion, two hundred twenty billion, five hundred fifty-five million, two hundred fifteen thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •