Base | Representation |
---|---|
bin | 10010001100111010111111… |
… | …00100001101111101110101 |
3 | 12020201111010212212220022111 |
4 | 21012131133210031331311 |
5 | 20221243033302430313 |
6 | 221043513112131021 |
7 | 11300545410442450 |
oct | 1106353744157565 |
9 | 166644125786274 |
10 | 40026403561333 |
11 | 11832114362542 |
12 | 45a5475696a71 |
13 | 1944620828737 |
14 | 9c5407020497 |
15 | 4962a2c3943d |
hex | 24675f90df75 |
40026403561333 has 8 divisors (see below), whose sum is σ = 46104653821952. Its totient is φ = 34038201452976.
The previous prime is 40026403561213. The next prime is 40026403561409. The reversal of 40026403561333 is 33316530462004.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 40026403561333 - 213 = 40026403553141 is a prime.
It is a super-2 number, since 2×400264035613332 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40026403561633) 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, 22512037110 + ... + 22512038887.
It is an arithmetic number, because the mean of its divisors is an integer number (5763081727744).
Almost surely, 240026403561333 is an apocalyptic number.
It is an amenable number.
40026403561333 is a deficient number, since it is larger than the sum of its proper divisors (6078250260619).
40026403561333 is a wasteful number, since it uses less digits than its factorization.
40026403561333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45024076131.
The product of its (nonzero) digits is 466560, while the sum is 40.
The spelling of 40026403561333 in words is "forty trillion, twenty-six billion, four hundred three million, five hundred sixty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •