Base | Representation |
---|---|
bin | 1001010011100001011111… |
… | …1010100010011010000001 |
3 | 1100020002000220112211212011 |
4 | 2110320113322202122001 |
5 | 2320111103402222241 |
6 | 33432021310132521 |
7 | 2104111022226643 |
oct | 224702772423201 |
9 | 40202026484764 |
10 | 10231013320321 |
11 | 3294a4832a862 |
12 | 1192a097b1141 |
13 | 592a1b7618c1 |
14 | 275280072893 |
15 | 12b1eae54281 |
hex | 94e17ea2681 |
10231013320321 has 8 divisors (see below), whose sum is σ = 10273840426080. Its totient is φ = 10188262898688.
The previous prime is 10231013320309. The next prime is 10231013320361. The reversal of 10231013320321 is 12302331013201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10231013320321 - 217 = 10231013189249 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10231013320292 and 10231013320301.
It is not an unprimeable number, because it can be changed into a prime (10231013320361) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18903631 + ... + 19437316.
It is an arithmetic number, because the mean of its divisors is an integer number (1284230053260).
Almost surely, 210231013320321 is an apocalyptic number.
It is an amenable number.
10231013320321 is a deficient number, since it is larger than the sum of its proper divisors (42827105759).
10231013320321 is an equidigital number, since it uses as much as digits as its factorization.
10231013320321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38342063.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 10231013320321 its reverse (12302331013201), we get a palindrome (22533344333522).
The spelling of 10231013320321 in words is "ten trillion, two hundred thirty-one billion, thirteen million, three hundred twenty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •