Base | Representation |
---|---|
bin | 10001011110100010011… |
… | …100010010101010100111 |
3 | 11020211001020021111111001 |
4 | 101132202130102222213 |
5 | 124134142411413223 |
6 | 2315424100254131 |
7 | 152525265524425 |
oct | 21364234225247 |
9 | 4224036244431 |
10 | 1201021201063 |
11 | 423394180612 |
12 | 1749236a1347 |
13 | 89343038ba8 |
14 | 421b5dd4115 |
15 | 213946a89ad |
hex | 117a2712aa7 |
1201021201063 has 2 divisors, whose sum is σ = 1201021201064. Its totient is φ = 1201021201062.
The previous prime is 1201021200991. The next prime is 1201021201103. The reversal of 1201021201063 is 3601021201021.
It is a strong prime.
It is an emirp because it is prime and its reverse (3601021201021) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1201021201063 is a prime.
It is a super-2 number, since 2×12010212010632 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1201021201063.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1201021211063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 600510600531 + 600510600532.
It is an arithmetic number, because the mean of its divisors is an integer number (600510600532).
Almost surely, 21201021201063 is an apocalyptic number.
1201021201063 is a deficient number, since it is larger than the sum of its proper divisors (1).
1201021201063 is an equidigital number, since it uses as much as digits as its factorization.
1201021201063 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 1201021201063 its reverse (3601021201021), we get a palindrome (4802042402084).
The spelling of 1201021201063 in words is "one trillion, two hundred one billion, twenty-one million, two hundred one thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •