Base | Representation |
---|---|
bin | 10010010011000100010101… |
… | …11111101110000001111001 |
3 | 12021110200020112010102011111 |
4 | 21021202022333232001321 |
5 | 20233223033402311340 |
6 | 221324520332000321 |
7 | 11322032611162345 |
oct | 1111421277560171 |
9 | 167420215112144 |
10 | 40237585588345 |
11 | 11903734089082 |
12 | 461a3920000a1 |
13 | 195b5076a5932 |
14 | 9d171c236625 |
15 | 49ba12c06aea |
hex | 24988afee079 |
40237585588345 has 32 divisors (see below), whose sum is σ = 49540685838336. Its totient is φ = 31355525260800.
The previous prime is 40237585588339. The next prime is 40237585588493. The reversal of 40237585588345 is 54388558573204.
40237585588345 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 40237585588345 - 227 = 40237451370617 is a prime.
It is a super-3 number, since 3×402375855883453 (a number of 42 digits) contains 333 as substring.
It is a Duffinian number.
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 31 ways as a sum of consecutive naturals, for example, 334815007 + ... + 334935163.
It is an arithmetic number, because the mean of its divisors is an integer number (1548146432448).
Almost surely, 240237585588345 is an apocalyptic number.
It is an amenable number.
40237585588345 is a deficient number, since it is larger than the sum of its proper divisors (9303100249991).
40237585588345 is a wasteful number, since it uses less digits than its factorization.
40237585588345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122761.
The product of its (nonzero) digits is 645120000, while the sum is 67.
The spelling of 40237585588345 in words is "forty trillion, two hundred thirty-seven billion, five hundred eighty-five million, five hundred eighty-eight thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •