Base | Representation |
---|---|
bin | 1001010011011110100010… |
… | …1101010011100001010001 |
3 | 1100012222222201021011211220 |
4 | 2110313220231103201101 |
5 | 2320102443124303241 |
6 | 33431410534555253 |
7 | 2104052264321610 |
oct | 224675055234121 |
9 | 40188881234756 |
10 | 10230221322321 |
11 | 3294681264a60 |
12 | 1192828508b29 |
13 | 592923651030 |
14 | 275206bcb877 |
15 | 12b1a165d166 |
hex | 94de8b53851 |
10230221322321 has 64 divisors (see below), whose sum is σ = 18324500576256. Its totient is φ = 4902852902400.
The previous prime is 10230221322317. The next prime is 10230221322359. The reversal of 10230221322321 is 12322312203201.
It is not a de Polignac number, because 10230221322321 - 22 = 10230221322317 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10230221322291 and 10230221322300.
It is not an unprimeable number, because it can be changed into a prime (10230221320321) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4413181 + ... + 6319541.
It is an arithmetic number, because the mean of its divisors is an integer number (286320321504).
Almost surely, 210230221322321 is an apocalyptic number.
10230221322321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10230221322321 is a deficient number, since it is larger than the sum of its proper divisors (8094279253935).
10230221322321 is a wasteful number, since it uses less digits than its factorization.
10230221322321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1908182.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 10230221322321 its reverse (12322312203201), we get a palindrome (22552533525522).
The spelling of 10230221322321 in words is "ten trillion, two hundred thirty billion, two hundred twenty-one million, three hundred twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.151 sec. • engine limits •