Base | Representation |
---|---|
bin | 10001011110110100111… |
… | …010001010110110101001 |
3 | 11020211211211021002122201 |
4 | 101132310322022312221 |
5 | 124140311220221043 |
6 | 2315514525020201 |
7 | 152536050133243 |
oct | 21366472126651 |
9 | 4224754232581 |
10 | 1201331023273 |
11 | 423533053627 |
12 | 1749ab3b4661 |
13 | 89392295644 |
14 | 42205203093 |
15 | 213b19a7c4d |
hex | 117b4e8ada9 |
1201331023273 has 2 divisors, whose sum is σ = 1201331023274. Its totient is φ = 1201331023272.
The previous prime is 1201331023219. The next prime is 1201331023301. The reversal of 1201331023273 is 3723201331021.
It is a happy number.
It is an a-pointer prime, because the next prime (1201331023301) can be obtained adding 1201331023273 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1197179540649 + 4151482624 = 1094157^2 + 64432^2 .
It is a cyclic number.
It is not a de Polignac number, because 1201331023273 - 221 = 1201328926121 is a prime.
It is not a weakly prime, because it can be changed into another prime (1201331023573) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 600665511636 + 600665511637.
It is an arithmetic number, because the mean of its divisors is an integer number (600665511637).
Almost surely, 21201331023273 is an apocalyptic number.
It is an amenable number.
1201331023273 is a deficient number, since it is larger than the sum of its proper divisors (1).
1201331023273 is an equidigital number, since it uses as much as digits as its factorization.
1201331023273 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4536, while the sum is 28.
Adding to 1201331023273 its reverse (3723201331021), we get a palindrome (4924532354294).
The spelling of 1201331023273 in words is "one trillion, two hundred one billion, three hundred thirty-one million, twenty-three thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •