Base | Representation |
---|---|
bin | 10010010100111100010100… |
… | …11101011110011110111011 |
3 | 12021200211111202022112022000 |
4 | 21022132022131132132323 |
5 | 20240301444241334321 |
6 | 221414252252232043 |
7 | 11326503105160614 |
oct | 1112361235363673 |
9 | 167624452275260 |
10 | 40302001121211 |
11 | 11928a89a64355 |
12 | 462a96a76b623 |
13 | 1964601b73b5b |
14 | 9d48ad2c8c0b |
15 | 49d532e10826 |
hex | 24a78a75e7bb |
40302001121211 has 8 divisors (see below), whose sum is σ = 59706668327760. Its totient is φ = 26868000747456.
The previous prime is 40302001121209. The next prime is 40302001121243. The reversal of 40302001121211 is 11212110020304.
40302001121211 is a `hidden beast` number, since 40 + 302 + 0 + 0 + 112 + 1 + 211 = 666.
It is not a de Polignac number, because 40302001121211 - 21 = 40302001121209 is a prime.
It is a super-2 number, since 2×403020011212112 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (40302001131211) 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, 746333354070 + ... + 746333354123.
It is an arithmetic number, because the mean of its divisors is an integer number (7463333540970).
Almost surely, 240302001121211 is an apocalyptic number.
40302001121211 is a deficient number, since it is larger than the sum of its proper divisors (19404667206549).
40302001121211 is a wasteful number, since it uses less digits than its factorization.
40302001121211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1492666708202 (or 1492666708196 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 40302001121211 its reverse (11212110020304), we get a palindrome (51514111141515).
The spelling of 40302001121211 in words is "forty trillion, three hundred two billion, one million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •