Base | Representation |
---|---|
bin | 1001011000110000101110… |
… | …0111001011101101010000 |
3 | 1100112200022022200110121112 |
4 | 2112030023213023231100 |
5 | 2323044402303430412 |
6 | 33541222535312452 |
7 | 2113445013662114 |
oct | 226141347135520 |
9 | 40480268613545 |
10 | 10321001233232 |
11 | 331a126145718 |
12 | 11a834251b728 |
13 | 59b35cc11351 |
14 | 279779505744 |
15 | 12d7161e4722 |
hex | 9630b9cbb50 |
10321001233232 has 20 divisors (see below), whose sum is σ = 19997012127540. Its totient is φ = 5160481974528.
The previous prime is 10321001233141. The next prime is 10321001233271. The reversal of 10321001233232 is 23233210012301.
It can be written as a sum of positive squares in 2 ways, for example, as 7361693003536 + 2959308229696 = 2713244^2 + 1720264^2 .
It is a super-2 number, since 2×103210012332322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10321001233198 and 10321001233207.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4132244 + ... + 6141452.
It is an arithmetic number, because the mean of its divisors is an integer number (999850606377).
Almost surely, 210321001233232 is an apocalyptic number.
It is an amenable number.
10321001233232 is a deficient number, since it is larger than the sum of its proper divisors (9676010894308).
10321001233232 is a wasteful number, since it uses less digits than its factorization.
10321001233232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2330270 (or 2330264 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 10321001233232 its reverse (23233210012301), we get a palindrome (33554211245533).
The spelling of 10321001233232 in words is "ten trillion, three hundred twenty-one billion, one million, two hundred thirty-three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •