Base | Representation |
---|---|
bin | 1001101011100000101001… |
… | …1100111010001111010110 |
3 | 1101200110201020110010220001 |
4 | 2122320022130322033112 |
5 | 2343334034200411410 |
6 | 34345212530201514 |
7 | 2145640021652260 |
oct | 232701234721726 |
9 | 41613636403801 |
10 | 10643104310230 |
11 | 3433795a108a7 |
12 | 123a85612329a |
13 | 5c2843042132 |
14 | 28b1b3d7ab30 |
15 | 136cb909333a |
hex | 9ae0a73a3d6 |
10643104310230 has 64 divisors (see below), whose sum is σ = 22320334080000. Its totient is φ = 3578693010048.
The previous prime is 10643104310207. The next prime is 10643104310257. The reversal of 10643104310230 is 3201340134601.
It is a super-2 number, since 2×106431043102302 (a number of 27 digits) contains 22 as substring.
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 31 ways as a sum of consecutive naturals, for example, 5634460 + ... + 7282399.
It is an arithmetic number, because the mean of its divisors is an integer number (348755220000).
Almost surely, 210643104310230 is an apocalyptic number.
10643104310230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10643104310230 is an abundant number, since it is smaller than the sum of its proper divisors (11677229769770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10643104310230 is a wasteful number, since it uses less digits than its factorization.
10643104310230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12917101.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 10643104310230 its reverse (3201340134601), we get a palindrome (13844444444831).
The spelling of 10643104310230 in words is "ten trillion, six hundred forty-three billion, one hundred four million, three hundred ten thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •