Base | Representation |
---|---|
bin | 10010010000001001110111… |
… | …00010101011100011010011 |
3 | 12021010002211011211122011111 |
4 | 21020010323202223203103 |
5 | 20230103013343000042 |
6 | 221210522015354151 |
7 | 11311556611413361 |
oct | 1110047342534323 |
9 | 167102734748144 |
10 | 40137468328147 |
11 | 11875228542723 |
12 | 4602ab0b22957 |
13 | 1951c407bb378 |
14 | 9ca9417b0631 |
15 | 499103558517 |
hex | 24813b8ab8d3 |
40137468328147 has 4 divisors (see below), whose sum is σ = 40138917937560. Its totient is φ = 40136018718736.
The previous prime is 40137468328103. The next prime is 40137468328193. The reversal of 40137468328147 is 74182386473104.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-40137468328147 is a prime.
It is a super-2 number, since 2×401374683281472 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 40137468328091 and 40137468328100.
It is not an unprimeable number, because it can be changed into a prime (40737468328147) 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, 724763173 + ... + 724818550.
It is an arithmetic number, because the mean of its divisors is an integer number (10034729484390).
Almost surely, 240137468328147 is an apocalyptic number.
40137468328147 is a deficient number, since it is larger than the sum of its proper divisors (1449609413).
40137468328147 is a wasteful number, since it uses less digits than its factorization.
40137468328147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1449609412.
The product of its (nonzero) digits is 21676032, while the sum is 58.
The spelling of 40137468328147 in words is "forty trillion, one hundred thirty-seven billion, four hundred sixty-eight million, three hundred twenty-eight thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •