Base | Representation |
---|---|
bin | 10010011101011010011111… |
… | …10100000010111000001001 |
3 | 12022201122211012002110211111 |
4 | 21032231033310002320021 |
5 | 20310034104142122313 |
6 | 222200111242530321 |
7 | 11356516145025316 |
oct | 1116551764027011 |
9 | 168648735073744 |
10 | 40593074957833 |
11 | 11a30476610a22 |
12 | 46772628069a1 |
13 | 1985bab605388 |
14 | a04a02b55d0d |
15 | 4a5dbbb2a43d |
hex | 24eb4fd02e09 |
40593074957833 has 4 divisors (see below), whose sum is σ = 40912705469440. Its totient is φ = 40273444446228.
The previous prime is 40593074957819. The next prime is 40593074957837. The reversal of 40593074957833 is 33875947039504.
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 40593074957833 - 237 = 40455636004361 is a prime.
It is a super-2 number, since 2×405930749578332 (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 (40593074957837) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 159815255613 + ... + 159815255866.
It is an arithmetic number, because the mean of its divisors is an integer number (10228176367360).
Almost surely, 240593074957833 is an apocalyptic number.
It is an amenable number.
40593074957833 is a deficient number, since it is larger than the sum of its proper divisors (319630511607).
40593074957833 is a wasteful number, since it uses less digits than its factorization.
40593074957833 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 319630511606.
The product of its (nonzero) digits is 342921600, while the sum is 67.
The spelling of 40593074957833 in words is "forty trillion, five hundred ninety-three billion, seventy-four million, nine hundred fifty-seven thousand, eight hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •