Base | Representation |
---|---|
bin | 1001010011101001010100… |
… | …0100010011001010000100 |
3 | 1100020021110020112012211110 |
4 | 2110322111010103022010 |
5 | 2320124403414000200 |
6 | 33433005514205020 |
7 | 2104214036411205 |
oct | 224722504231204 |
9 | 40207406465743 |
10 | 10233113031300 |
11 | 3295925590795 |
12 | 11932b4a23770 |
13 | 592c9477b033 |
14 | 2753dcc855ac |
15 | 12b2c0460b50 |
hex | 94e95113284 |
10233113031300 has 72 divisors (see below), whose sum is σ = 29612330932576. Its totient is φ = 2728413192960.
The previous prime is 10233113031293. The next prime is 10233113031301. The reversal of 10233113031300 is 313031133201.
It is a super-2 number, since 2×102331130313002 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10233113031301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 636754 + ... + 4568553.
Almost surely, 210233113031300 is an apocalyptic number.
10233113031300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10233113031300 is an abundant number, since it is smaller than the sum of its proper divisors (19379217901276).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10233113031300 is a wasteful number, since it uses less digits than its factorization.
10233113031300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5211877 (or 5211870 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 10233113031300 its reverse (313031133201), we get a palindrome (10546144164501).
The spelling of 10233113031300 in words is "ten trillion, two hundred thirty-three billion, one hundred thirteen million, thirty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •