Base | Representation |
---|---|
bin | 101111000000011101000… |
… | …001000001011111010101 |
3 | 102102210222022111221010111 |
4 | 233000131001001133111 |
5 | 410411124331322401 |
6 | 10511551431123021 |
7 | 452244620530444 |
oct | 57003501013725 |
9 | 12383868457114 |
10 | 3230302214101 |
11 | 1035a66427926 |
12 | 442079813471 |
13 | 1a5801a08981 |
14 | b24c1610d5b |
15 | 590630dbe51 |
hex | 2f01d0417d5 |
3230302214101 has 2 divisors, whose sum is σ = 3230302214102. Its totient is φ = 3230302214100.
The previous prime is 3230302214089. The next prime is 3230302214131. The reversal of 3230302214101 is 1014122030323.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2863290399876 + 367011814225 = 1692126^2 + 605815^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3230302214101 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3230302214131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1615151107050 + 1615151107051.
It is an arithmetic number, because the mean of its divisors is an integer number (1615151107051).
Almost surely, 23230302214101 is an apocalyptic number.
It is an amenable number.
3230302214101 is a deficient number, since it is larger than the sum of its proper divisors (1).
3230302214101 is an equidigital number, since it uses as much as digits as its factorization.
3230302214101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 3230302214101 its reverse (1014122030323), we get a palindrome (4244424244424).
The spelling of 3230302214101 in words is "three trillion, two hundred thirty billion, three hundred two million, two hundred fourteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •