Base | Representation |
---|---|
bin | 10010111100111001000… |
… | …011100101010011000001 |
3 | 11121111112210001011011020 |
4 | 102330321003211103001 |
5 | 132314134034044301 |
6 | 2434141101340053 |
7 | 163043003110656 |
oct | 22747103452301 |
9 | 4544483034136 |
10 | 1302332331201 |
11 | 462352716140 |
12 | 190498567629 |
13 | 95a6a37c685 |
14 | 47067231c2d |
15 | 23d23a81436 |
hex | 12f390e54c1 |
1302332331201 has 16 divisors (see below), whose sum is σ = 1894343467968. Its totient is φ = 789274865600.
The previous prime is 1302332331197. The next prime is 1302332331203. The reversal of 1302332331201 is 1021332332031.
It is a cyclic number.
It is not a de Polignac number, because 1302332331201 - 22 = 1302332331197 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1302332331203) 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 in 15 ways as a sum of consecutive naturals, for example, 1166131 + ... + 1991111.
It is an arithmetic number, because the mean of its divisors is an integer number (118396466748).
Almost surely, 21302332331201 is an apocalyptic number.
1302332331201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1302332331201 is a deficient number, since it is larger than the sum of its proper divisors (592011136767).
1302332331201 is a wasteful number, since it uses less digits than its factorization.
1302332331201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 872832.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 1302332331201 its reverse (1021332332031), we get a palindrome (2323664663232).
The spelling of 1302332331201 in words is "one trillion, three hundred two billion, three hundred thirty-two million, three hundred thirty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •