Base | Representation |
---|---|
bin | 10010001111001011111100… |
… | …11001010101010110011110 |
3 | 12020222221000202110102220120 |
4 | 21013211332121111112132 |
5 | 20224031430413304042 |
6 | 221143343511255410 |
7 | 11306302132166553 |
oct | 1107457631252636 |
9 | 166887022412816 |
10 | 40104230213022 |
11 | 11862121492898 |
12 | 45b857567a566 |
13 | 194ba74600b21 |
14 | 9c90ab298a2a |
15 | 49830a502dec |
hex | 24797e65559e |
40104230213022 has 16 divisors (see below), whose sum is σ = 80212289791872. Its totient is φ = 13367438510040.
The previous prime is 40104230212951. The next prime is 40104230213023. The reversal of 40104230213022 is 22031203240104.
It is a happy number.
It is a super-2 number, since 2×401042302130222 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 40104230212983 and 40104230213001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40104230213023) 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, 159420754 + ... + 159672117.
It is an arithmetic number, because the mean of its divisors is an integer number (5013268111992).
Almost surely, 240104230213022 is an apocalyptic number.
40104230213022 is an abundant number, since it is smaller than the sum of its proper divisors (40108059578850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40104230213022 is a wasteful number, since it uses less digits than its factorization.
40104230213022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 319113823.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 40104230213022 its reverse (22031203240104), we get a palindrome (62135433453126).
The spelling of 40104230213022 in words is "forty trillion, one hundred four billion, two hundred thirty million, two hundred thirteen thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •