Base | Representation |
---|---|
bin | 10010010010100100000000… |
… | …01011000011111010011001 |
3 | 12021102000102120111121110021 |
4 | 21021102000023003322121 |
5 | 20232432004340034001 |
6 | 221312525455550441 |
7 | 11320546435264540 |
oct | 1111220013037231 |
9 | 167360376447407 |
10 | 40220224143001 |
11 | 118a7334a98241 |
12 | 4616b4782b421 |
13 | 195999b84c956 |
14 | 9d095254b157 |
15 | 49b348934ba1 |
hex | 2494802c3e99 |
40220224143001 has 8 divisors (see below), whose sum is σ = 45966601247360. Its totient is φ = 34474004738208.
The previous prime is 40220224142981. The next prime is 40220224143037. The reversal of 40220224143001 is 10034142202204.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 40220224143001 - 29 = 40220224142489 is a prime.
It is a super-2 number, since 2×402202241430012 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40220224743001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38877861 + ... + 39898978.
It is an arithmetic number, because the mean of its divisors is an integer number (5745825155920).
Almost surely, 240220224143001 is an apocalyptic number.
It is an amenable number.
40220224143001 is a deficient number, since it is larger than the sum of its proper divisors (5746377104359).
40220224143001 is an equidigital number, since it uses as much as digits as its factorization.
40220224143001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78849783.
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 40220224143001 its reverse (10034142202204), we get a palindrome (50254366345205).
The spelling of 40220224143001 in words is "forty trillion, two hundred twenty billion, two hundred twenty-four million, one hundred forty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •