Base | Representation |
---|---|
bin | 10010010100001001001010… |
… | …01111011111010100000001 |
3 | 12021121012121110111010012001 |
4 | 21022010211033133110001 |
5 | 20234324220441331001 |
6 | 221353510510304001 |
7 | 11324511322245001 |
oct | 1112044517372401 |
9 | 167535543433161 |
10 | 40274533152001 |
11 | 11918374011555 |
12 | 46255837b8001 |
13 | 1961b45244635 |
14 | 9d342526c001 |
15 | 49c97673d001 |
hex | 24a1253df501 |
40274533152001 has 8 divisors (see below), whose sum is σ = 40304215649600. Its totient is φ = 40244851934928.
The previous prime is 40274533151981. The next prime is 40274533152011. The reversal of 40274533152001 is 10025133547204.
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 40274533152001 - 231 = 40272385668353 is a prime.
It is a super-2 number, since 2×402745331520012 (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 (40274533152011) 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, 67957975 + ... + 68548051.
It is an arithmetic number, because the mean of its divisors is an integer number (5038026956200).
Almost surely, 240274533152001 is an apocalyptic number.
It is an amenable number.
40274533152001 is a deficient number, since it is larger than the sum of its proper divisors (29682497599).
40274533152001 is a wasteful number, since it uses less digits than its factorization.
40274533152001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 640263.
The product of its (nonzero) digits is 100800, while the sum is 37.
Adding to 40274533152001 its reverse (10025133547204), we get a palindrome (50299666699205).
The spelling of 40274533152001 in words is "forty trillion, two hundred seventy-four billion, five hundred thirty-three million, one hundred fifty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •