Base | Representation |
---|---|
bin | 1001010111101011001000… |
… | …1100100011001010010001 |
3 | 1100110220002110220222002021 |
4 | 2111322302030203022101 |
5 | 2322243123212210001 |
6 | 33524453201451441 |
7 | 2112214060260022 |
oct | 225726214431221 |
9 | 40426073828067 |
10 | 10302321210001 |
11 | 331220a818797 |
12 | 11a47aa640b81 |
13 | 599673b47372 |
14 | 2788c6660c49 |
15 | 12cec12b2ba1 |
hex | 95eb2323291 |
10302321210001 has 8 divisors (see below), whose sum is σ = 10327863460608. Its totient is φ = 10276786548000.
The previous prime is 10302321209989. The next prime is 10302321210017. The reversal of 10302321210001 is 10001212320301.
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 10302321210001 - 211 = 10302321207953 is a prime.
It is a super-2 number, since 2×103023212100012 (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 (10302321210031) 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, 826261 + ... + 4613821.
It is an arithmetic number, because the mean of its divisors is an integer number (1290982932576).
Almost surely, 210302321210001 is an apocalyptic number.
It is an amenable number.
10302321210001 is a deficient number, since it is larger than the sum of its proper divisors (25542250607).
10302321210001 is an equidigital number, since it uses as much as digits as its factorization.
10302321210001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3794303.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 10302321210001 its reverse (10001212320301), we get a palindrome (20303533530302).
The spelling of 10302321210001 in words is "ten trillion, three hundred two billion, three hundred twenty-one million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •