Base | Representation |
---|---|
bin | 101101100011000110100010… |
… | …110011101001100101110110 |
3 | 222021021211000222100221112020 |
4 | 231203012202303221211312 |
5 | 202224103132040221210 |
6 | 1550015414035334010 |
7 | 60123644633225322 |
oct | 5543064263514566 |
9 | 867254028327466 |
10 | 200324301101430 |
11 | 58914071589850 |
12 | 1a574237151306 |
13 | 87a16678ac03c |
14 | 3767a68380982 |
15 | 1825d64db9770 |
hex | b631a2ce9976 |
200324301101430 has 64 divisors (see below), whose sum is σ = 524634829410816. Its totient is φ = 48549634848000.
The previous prime is 200324301101401. The next prime is 200324301101513. The reversal of 200324301101430 is 34101103423002.
It is a happy number.
It is a super-2 number, since 2×2003243011014302 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 200324301101430.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 85290151 + ... + 87607410.
It is an arithmetic number, because the mean of its divisors is an integer number (8197419209544).
Almost surely, 2200324301101430 is an apocalyptic number.
200324301101430 is an abundant number, since it is smaller than the sum of its proper divisors (324310528309386).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200324301101430 is a wasteful number, since it uses less digits than its factorization.
200324301101430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172901093.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 200324301101430 its reverse (34101103423002), we get a palindrome (234425404524432).
The spelling of 200324301101430 in words is "two hundred trillion, three hundred twenty-four billion, three hundred one million, one hundred one thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •