Base | Representation |
---|---|
bin | 10010010111000110010111… |
… | …00010011111111101110000 |
3 | 12021221220210100100121011220 |
4 | 21023203023202133331300 |
5 | 20243010231443313242 |
6 | 221512305551105040 |
7 | 11335035403152642 |
oct | 1113431342377560 |
9 | 167856710317156 |
10 | 40376107401072 |
11 | 11957458030243 |
12 | 46411b0812180 |
13 | 196b5b1c41bb1 |
14 | 9d82dd3dc892 |
15 | 4a041dc8bbec |
hex | 24b8cb89ff70 |
40376107401072 has 80 divisors (see below), whose sum is σ = 106078635711360. Its totient is φ = 13229864032000.
The previous prime is 40376107401067. The next prime is 40376107401079. The reversal of 40376107401072 is 27010470167304.
It is a happy number.
It is a super-2 number, since 2×403761074010722 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40376107401079) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 52580047 + ... + 53342417.
It is an arithmetic number, because the mean of its divisors is an integer number (1325982946392).
Almost surely, 240376107401072 is an apocalyptic number.
It is an amenable number.
40376107401072 is an abundant number, since it is smaller than the sum of its proper divisors (65702528310288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40376107401072 is a wasteful number, since it uses less digits than its factorization.
40376107401072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 781142 (or 781136 counting only the distinct ones).
The product of its (nonzero) digits is 197568, while the sum is 42.
Adding to 40376107401072 its reverse (27010470167304), we get a palindrome (67386577568376).
The spelling of 40376107401072 in words is "forty trillion, three hundred seventy-six billion, one hundred seven million, four hundred one thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •