Base | Representation |
---|---|
bin | 100001100000111011011… |
… | …101110001001110111000 |
3 | 22011011201000012210220102 |
4 | 201200323131301032320 |
5 | 300213222113131412 |
6 | 4522010220414532 |
7 | 325251653050106 |
oct | 41407335611670 |
9 | 8134630183812 |
10 | 2303100130232 |
11 | 808814a88890 |
12 | 3124336a7448 |
13 | 139248735365 |
14 | 7d683620c76 |
15 | 3ed9790d8c2 |
hex | 2183b7713b8 |
2303100130232 has 32 divisors (see below), whose sum is σ = 4958828035200. Its totient is φ = 991765605600.
The previous prime is 2303100130229. The next prime is 2303100130241. The reversal of 2303100130232 is 2320310013032.
2303100130232 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 688724444 + ... + 688727787.
It is an arithmetic number, because the mean of its divisors is an integer number (154963376100).
Almost surely, 22303100130232 is an apocalyptic number.
2303100130232 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2303100130232 is an abundant number, since it is smaller than the sum of its proper divisors (2655727904968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2303100130232 is a wasteful number, since it uses less digits than its factorization.
2303100130232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1377452267 (or 1377452263 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 2303100130232 its reverse (2320310013032), we get a palindrome (4623410143264).
The spelling of 2303100130232 in words is "two trillion, three hundred three billion, one hundred million, one hundred thirty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •