Base | Representation |
---|---|
bin | 10001011101100101101… |
… | …101011111110010010001 |
3 | 11020201102020001000110101 |
4 | 101131211231133302101 |
5 | 124130101042113243 |
6 | 2315135021532401 |
7 | 152461114155502 |
oct | 21354555376221 |
9 | 4221366030411 |
10 | 1200002301073 |
11 | 422a11018a04 |
12 | 17469a414101 |
13 | 8920cc121a4 |
14 | 4211a966ba9 |
15 | 21334ee254d |
hex | 11765b5fc91 |
1200002301073 has 2 divisors, whose sum is σ = 1200002301074. Its totient is φ = 1200002301072.
The previous prime is 1200002301061. The next prime is 1200002301149. The reversal of 1200002301073 is 3701032000021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 870362116624 + 329640184449 = 932932^2 + 574143^2 .
It is a cyclic number.
It is not a de Polignac number, because 1200002301073 - 233 = 1191412366481 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1200002301073.
It is not a weakly prime, because it can be changed into another prime (1200002301013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 600001150536 + 600001150537.
It is an arithmetic number, because the mean of its divisors is an integer number (600001150537).
Almost surely, 21200002301073 is an apocalyptic number.
It is an amenable number.
1200002301073 is a deficient number, since it is larger than the sum of its proper divisors (1).
1200002301073 is an equidigital number, since it uses as much as digits as its factorization.
1200002301073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 19.
Adding to 1200002301073 its reverse (3701032000021), we get a palindrome (4901034301094).
The spelling of 1200002301073 in words is "one trillion, two hundred billion, two million, three hundred one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •