Base | Representation |
---|---|
bin | 10010010000001111001010… |
… | …00010111011011010100001 |
3 | 12021010101011100221210121201 |
4 | 21020013211002323122201 |
5 | 20230124324401144413 |
6 | 221212112124121201 |
7 | 11312020232346436 |
oct | 1110074502733241 |
9 | 167111140853551 |
10 | 40140312131233 |
11 | 11876457819006 |
12 | 4603565396201 |
13 | 19522a4a141a2 |
14 | 9cab31357b8d |
15 | 49921d0469dd |
hex | 2481e50bb6a1 |
40140312131233 has 8 divisors (see below), whose sum is σ = 44738428381920. Its totient is φ = 35790742704960.
The previous prime is 40140312131209. The next prime is 40140312131281. The reversal of 40140312131233 is 33213121304104.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-40140312131233 is a prime.
It is a super-2 number, since 2×401403121312332 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (40140312131203) 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, 62136705763 + ... + 62136706408.
It is an arithmetic number, because the mean of its divisors is an integer number (5592303547740).
Almost surely, 240140312131233 is an apocalyptic number.
It is an amenable number.
40140312131233 is a deficient number, since it is larger than the sum of its proper divisors (4598116250687).
40140312131233 is a wasteful number, since it uses less digits than its factorization.
40140312131233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 124273412207.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 40140312131233 its reverse (33213121304104), we get a palindrome (73353433435337).
The spelling of 40140312131233 in words is "forty trillion, one hundred forty billion, three hundred twelve million, one hundred thirty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.259 sec. • engine limits •