Base | Representation |
---|---|
bin | 1001011000101101011100… |
… | …1010100000100011100111 |
3 | 1100112121000222221021211010 |
4 | 2112023113022200203213 |
5 | 2323041102023114343 |
6 | 33540555343313303 |
7 | 2113414140454506 |
oct | 226132712404347 |
9 | 40477028837733 |
10 | 10320121301223 |
11 | 331981447a788 |
12 | 11a81378ab833 |
13 | 59b24c823016 |
14 | 2796d46d083d |
15 | 12d6b3d2dd33 |
hex | 962d72a08e7 |
10320121301223 has 8 divisors (see below), whose sum is σ = 13760185482736. Its totient is φ = 6880068993600.
The previous prime is 10320121301221. The next prime is 10320121301239. The reversal of 10320121301223 is 32210312102301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10320121301223 - 21 = 10320121301221 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10320121301223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10320121301221) 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, 690808 + ... + 4595373.
It is an arithmetic number, because the mean of its divisors is an integer number (1720023185342).
Almost surely, 210320121301223 is an apocalyptic number.
10320121301223 is a deficient number, since it is larger than the sum of its proper divisors (3440064181513).
10320121301223 is an equidigital number, since it uses as much as digits as its factorization.
10320121301223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5936945.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 10320121301223 its reverse (32210312102301), we get a palindrome (42530433403524).
The spelling of 10320121301223 in words is "ten trillion, three hundred twenty billion, one hundred twenty-one million, three hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •