Base | Representation |
---|---|
bin | 1001011000111100101100… |
… | …0011100111011111000100 |
3 | 1100112222121011102222221101 |
4 | 2112033023003213133010 |
5 | 2323122442030312200 |
6 | 33542513353425444 |
7 | 2113620424463101 |
oct | 226171303473704 |
9 | 40488534388841 |
10 | 10324213135300 |
11 | 3320524188239 |
12 | 11a8a9a10b284 |
13 | 59b75248940c |
14 | 2799a1d0baa8 |
15 | 12d85319426a |
hex | 963cb0e77c4 |
10324213135300 has 72 divisors (see below), whose sum is σ = 23799031625600. Its totient is φ = 3876440353920.
The previous prime is 10324213135273. The next prime is 10324213135339. The reversal of 10324213135300 is 353131242301.
It is a super-2 number, since 2×103242131353002 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 24718572 + ... + 25132771.
Almost surely, 210324213135300 is an apocalyptic number.
10324213135300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10324213135300 is an abundant number, since it is smaller than the sum of its proper divisors (13474818490300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10324213135300 is a wasteful number, since it uses less digits than its factorization.
10324213135300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49851485 (or 49851478 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 28.
Adding to 10324213135300 its reverse (353131242301), we get a palindrome (10677344377601).
The spelling of 10324213135300 in words is "ten trillion, three hundred twenty-four billion, two hundred thirteen million, one hundred thirty-five thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •