Base | Representation |
---|---|
bin | 10010100001111100101001… |
… | …11110010110111110101011 |
3 | 12100021112220201001110002022 |
4 | 21100332110332112332223 |
5 | 20320112123123042141 |
6 | 222355433134455055 |
7 | 11404002410010122 |
oct | 1120762476267653 |
9 | 170245821043068 |
10 | 40748854112171 |
11 | 11a9054590a287 |
12 | 46a149896448b |
13 | 19977a6277c8a |
14 | a0c37dc68ab9 |
15 | 4a9e87c6bb4b |
hex | 250f94f96fab |
40748854112171 has 8 divisors (see below), whose sum is σ = 43145905545360. Its totient is φ = 38351809347328.
The previous prime is 40748854112167. The next prime is 40748854112243. The reversal of 40748854112171 is 17121145884704.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 40748854112171 - 22 = 40748854112167 is a prime.
It is a super-2 number, since 2×407488541121712 (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 (40748854112101) 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, 16688480 + ... + 18973746.
It is an arithmetic number, because the mean of its divisors is an integer number (5393238193170).
Almost surely, 240748854112171 is an apocalyptic number.
40748854112171 is a deficient number, since it is larger than the sum of its proper divisors (2397051433189).
40748854112171 is a wasteful number, since it uses less digits than its factorization.
40748854112171 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3334173.
The product of its (nonzero) digits is 2007040, while the sum is 53.
Adding to 40748854112171 its reverse (17121145884704), we get a palindrome (57869999996875).
The spelling of 40748854112171 in words is "forty trillion, seven hundred forty-eight billion, eight hundred fifty-four million, one hundred twelve thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •