Base | Representation |
---|---|
bin | 10010010000000000010010… |
… | …00110111001001001010100 |
3 | 12021002121112212221001201101 |
4 | 21020000021012321021110 |
5 | 20230012001231400300 |
6 | 221204311523435444 |
7 | 11311315323603346 |
oct | 1110001106711124 |
9 | 167077485831641 |
10 | 40132327215700 |
11 | 1187302a513865 |
12 | 4601ab7225b84 |
13 | 1951601652cb5 |
14 | 9ca5b4a99296 |
15 | 498e0202ab6a |
hex | 2480091b9254 |
40132327215700 has 36 divisors (see below), whose sum is σ = 87329732726880. Its totient is φ = 16008215187040.
The previous prime is 40132327215691. The next prime is 40132327215727. The reversal of 40132327215700 is 751272323104.
It is a super-2 number, since 2×401323272157002 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 40132327215700.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 558910162 + ... + 558981961.
It is an arithmetic number, because the mean of its divisors is an integer number (2425825909080).
Almost surely, 240132327215700 is an apocalyptic number.
It is an amenable number.
40132327215700 is an abundant number, since it is smaller than the sum of its proper divisors (47197405511180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40132327215700 is a wasteful number, since it uses less digits than its factorization.
40132327215700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1117892496 (or 1117892489 counting only the distinct ones).
The product of its (nonzero) digits is 70560, while the sum is 37.
Adding to 40132327215700 its reverse (751272323104), we get a palindrome (40883599538804).
The spelling of 40132327215700 in words is "forty trillion, one hundred thirty-two billion, three hundred twenty-seven million, two hundred fifteen thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •