Base | Representation |
---|---|
bin | 10010010101100011110101… |
… | …00111110011100110111000 |
3 | 12021202212020211222220021011 |
4 | 21022301322213303212320 |
5 | 20241123413304331300 |
6 | 221432121013123304 |
7 | 11331153511501612 |
oct | 1112617247634670 |
9 | 167685224886234 |
10 | 40323210230200 |
11 | 11936a82a508a7 |
12 | 4632aa9629534 |
13 | 1966601bb20a1 |
14 | 9d5921dd1db2 |
15 | 49dd74db5eba |
hex | 24ac7a9f39b8 |
40323210230200 has 48 divisors (see below), whose sum is σ = 93834503694000. Its totient is φ = 16114997656320.
The previous prime is 40323210230183. The next prime is 40323210230221. The reversal of 40323210230200 is 203201232304.
It is a super-2 number, since 2×403232102302002 (a number of 28 digits) contains 22 as substring.
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, 89063860 + ... + 89515459.
It is an arithmetic number, because the mean of its divisors is an integer number (1954885493625).
Almost surely, 240323210230200 is an apocalyptic number.
40323210230200 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
40323210230200 is an abundant number, since it is smaller than the sum of its proper divisors (53511293463800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40323210230200 is a wasteful number, since it uses less digits than its factorization.
40323210230200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178580464 (or 178580455 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 22.
Adding to 40323210230200 its reverse (203201232304), we get a palindrome (40526411462504).
The spelling of 40323210230200 in words is "forty trillion, three hundred twenty-three billion, two hundred ten million, two hundred thirty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •