Base | Representation |
---|---|
bin | 1001011000101110001000… |
… | …0000011100001011000001 |
3 | 1100112121111200020021101201 |
4 | 2112023202000130023001 |
5 | 2323041440110224301 |
6 | 33541025402301201 |
7 | 2113421506616344 |
oct | 226134200341301 |
9 | 40477450207351 |
10 | 10320303211201 |
11 | 33198a8127405 |
12 | 11a81887b7801 |
13 | 59b27b415369 |
14 | 27971092445b |
15 | 12d6c4cb3201 |
hex | 962e201c2c1 |
10320303211201 has 8 divisors (see below), whose sum is σ = 10385032089600. Its totient is φ = 10255591578672.
The previous prime is 10320303211139. The next prime is 10320303211219. The reversal of 10320303211201 is 10211230302301.
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 10320303211201 - 243 = 1524210188993 is a prime.
It is a super-2 number, since 2×103203032112012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10320303211291) 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, 3109825 + ... + 5505598.
It is an arithmetic number, because the mean of its divisors is an integer number (1298129011200).
Almost surely, 210320303211201 is an apocalyptic number.
It is an amenable number.
10320303211201 is a deficient number, since it is larger than the sum of its proper divisors (64728878399).
10320303211201 is an equidigital number, since it uses as much as digits as its factorization.
10320303211201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8622935.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 10320303211201 its reverse (10211230302301), we get a palindrome (20531533513502).
The spelling of 10320303211201 in words is "ten trillion, three hundred twenty billion, three hundred three million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •