Base | Representation |
---|---|
bin | 10010010101010001101000… |
… | …10010001011111100100011 |
3 | 12021201221000222000002222001 |
4 | 21022220310102023330203 |
5 | 20240443411144114021 |
6 | 221423423324024431 |
7 | 11330356426012624 |
oct | 1112506422137443 |
9 | 167657028002861 |
10 | 40313440223011 |
11 | 1193291a04489a |
12 | 4631021692117 |
13 | 1965705a50847 |
14 | 9d527661ba4b |
15 | 49d9a22d9091 |
hex | 24aa3448bf23 |
40313440223011 has 4 divisors (see below), whose sum is σ = 41613873778624. Its totient is φ = 39013006667400.
The previous prime is 40313440222967. The next prime is 40313440223029. The reversal of 40313440223011 is 11032204431304.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 40313440223011 - 243 = 31517347200803 is a prime.
It is a super-2 number, since 2×403134402230112 (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 (40313440223051) 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, 650216777760 + ... + 650216777821.
It is an arithmetic number, because the mean of its divisors is an integer number (10403468444656).
Almost surely, 240313440223011 is an apocalyptic number.
40313440223011 is a deficient number, since it is larger than the sum of its proper divisors (1300433555613).
40313440223011 is a wasteful number, since it uses less digits than its factorization.
40313440223011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1300433555612.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 40313440223011 its reverse (11032204431304), we get a palindrome (51345644654315).
The spelling of 40313440223011 in words is "forty trillion, three hundred thirteen billion, four hundred forty million, two hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •