Base | Representation |
---|---|
bin | 1001011000110001011110… |
… | …0001101110101011111000 |
3 | 1100112200211020211021202010 |
4 | 2112030113201232223320 |
5 | 2323100304442131412 |
6 | 33541254440005520 |
7 | 2113452662040156 |
oct | 226142741565370 |
9 | 40480736737663 |
10 | 10321201130232 |
11 | 331a218a68253 |
12 | 11a83994608a0 |
13 | 59b3924607b5 |
14 | 279797c9c3d6 |
15 | 12d728a2d33c |
hex | 9631786eaf8 |
10321201130232 has 32 divisors (see below), whose sum is σ = 25891067699280. Its totient is φ = 3428658393600.
The previous prime is 10321201130203. The next prime is 10321201130293. The reversal of 10321201130232 is 23203110212301.
It is a junction number, because it is equal to n+sod(n) for n = 10321201130199 and 10321201130208.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 733866769 + ... + 733880832.
Almost surely, 210321201130232 is an apocalyptic number.
10321201130232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10321201130232 is an abundant number, since it is smaller than the sum of its proper divisors (15569866569048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10321201130232 is a wasteful number, since it uses less digits than its factorization.
10321201130232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1467747903 (or 1467747899 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 10321201130232 its reverse (23203110212301), we get a palindrome (33524311342533).
The spelling of 10321201130232 in words is "ten trillion, three hundred twenty-one billion, two hundred one million, one hundred thirty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •