Base | Representation |
---|---|
bin | 10010010000011001100000… |
… | …00010000101001000100111 |
3 | 12021010220111100222021011212 |
4 | 21020030300002011020213 |
5 | 20230222212440324044 |
6 | 221214431133022035 |
7 | 11312304651362315 |
oct | 1110146002051047 |
9 | 167126440867155 |
10 | 40145865167399 |
11 | 118788473172a2 |
12 | 460465502491b |
13 | 195297b3071c4 |
14 | 9cb0daa590b5 |
15 | 4994457e0a9e |
hex | 248330085227 |
40145865167399 has 2 divisors, whose sum is σ = 40145865167400. Its totient is φ = 40145865167398.
The previous prime is 40145865167383. The next prime is 40145865167467. The reversal of 40145865167399 is 99376156854104.
It is a happy number.
It is an a-pointer prime, because the next prime (40145865167467) can be obtained adding 40145865167399 to its sum of digits (68).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 40145865167399 - 24 = 40145865167383 is a prime.
It is a super-2 number, since 2×401458651673992 (a number of 28 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40145865167329) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20072932583699 + 20072932583700.
It is an arithmetic number, because the mean of its divisors is an integer number (20072932583700).
Almost surely, 240145865167399 is an apocalyptic number.
40145865167399 is a deficient number, since it is larger than the sum of its proper divisors (1).
40145865167399 is an equidigital number, since it uses as much as digits as its factorization.
40145865167399 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 195955200, while the sum is 68.
The spelling of 40145865167399 in words is "forty trillion, one hundred forty-five billion, eight hundred sixty-five million, one hundred sixty-seven thousand, three hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •