Base | Representation |
---|---|
bin | 100001110011101111100… |
… | …010011101111111011000 |
3 | 22020002211211221221021102 |
4 | 201303233202131333120 |
5 | 301031110042131300 |
6 | 4535150530130532 |
7 | 326565365524541 |
oct | 41635742357730 |
9 | 8202754857242 |
10 | 2323301130200 |
11 | 816340a13086 |
12 | 316330a20a48 |
13 | 13b11795748b |
14 | 8063c4a94c8 |
15 | 4067b1300d5 |
hex | 21cef89dfd8 |
2323301130200 has 48 divisors (see below), whose sum is σ = 5437447881360. Its totient is φ = 923166000000.
The previous prime is 2323301130127. The next prime is 2323301130203. The reversal of 2323301130200 is 20311033232.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2323301130203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 38435051 + ... + 38495450.
It is an arithmetic number, because the mean of its divisors is an integer number (113280164195).
Almost surely, 22323301130200 is an apocalyptic number.
2323301130200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2323301130200 is an abundant number, since it is smaller than the sum of its proper divisors (3114146751160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2323301130200 is a wasteful number, since it uses less digits than its factorization.
2323301130200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76930668 (or 76930659 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 2323301130200 its reverse (20311033232), we get a palindrome (2343612163432).
The spelling of 2323301130200 in words is "two trillion, three hundred twenty-three billion, three hundred one million, one hundred thirty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •