Base | Representation |
---|---|
bin | 10010010000001111101101… |
… | …10111010011100101100010 |
3 | 12021010101221012110200112221 |
4 | 21020013312313103211202 |
5 | 20230130432413340102 |
6 | 221212201523341254 |
7 | 11312030522335036 |
oct | 1110076667234542 |
9 | 167111835420487 |
10 | 40140611074402 |
11 | 118765a0540483 |
12 | 460362952182a |
13 | 1952321931c37 |
14 | 9cab5cd341c6 |
15 | 4992393e7637 |
hex | 2481f6dd3962 |
40140611074402 has 8 divisors (see below), whose sum is σ = 63379912222800. Its totient is φ = 19013973666804.
The previous prime is 40140611074391. The next prime is 40140611074433. The reversal of 40140611074402 is 20447011604104.
40140611074402 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×401406110744022 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 528165935152 + ... + 528165935227.
It is an arithmetic number, because the mean of its divisors is an integer number (7922489027850).
Almost surely, 240140611074402 is an apocalyptic number.
40140611074402 is a deficient number, since it is larger than the sum of its proper divisors (23239301148398).
40140611074402 is a wasteful number, since it uses less digits than its factorization.
40140611074402 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1056331870400.
The product of its (nonzero) digits is 21504, while the sum is 34.
Adding to 40140611074402 its reverse (20447011604104), we get a palindrome (60587622678506).
The spelling of 40140611074402 in words is "forty trillion, one hundred forty billion, six hundred eleven million, seventy-four thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •