Base | Representation |
---|---|
bin | 1001000110001001001100… |
… | …01011010100111110110001 |
3 | 2121211012102220100020201221 |
4 | 10203010212023110332301 |
5 | 10110204204104414301 |
6 | 110312533051425041 |
7 | 4133055501635116 |
oct | 443044613247661 |
9 | 77735386306657 |
10 | 20002303201201 |
11 | 6411a24775202 |
12 | 22b06b6a55181 |
13 | b21294509c99 |
14 | 4d218c0c090d |
15 | 24a48c18ada1 |
hex | 1231262d4fb1 |
20002303201201 has 4 divisors (see below), whose sum is σ = 20003137314804. Its totient is φ = 20001469087600.
The previous prime is 20002303201157. The next prime is 20002303201211. The reversal of 20002303201201 is 10210230320002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 28340039025 + 19973963162176 = 168345^2 + 4469224^2 .
It is a cyclic number.
It is not a de Polignac number, because 20002303201201 - 215 = 20002303168433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20002303201211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 417020830 + ... + 417068791.
It is an arithmetic number, because the mean of its divisors is an integer number (5000784328701).
Almost surely, 220002303201201 is an apocalyptic number.
It is an amenable number.
20002303201201 is a deficient number, since it is larger than the sum of its proper divisors (834113603).
20002303201201 is an equidigital number, since it uses as much as digits as its factorization.
20002303201201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 834113602.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 20002303201201 its reverse (10210230320002), we get a palindrome (30212533521203).
The spelling of 20002303201201 in words is "twenty trillion, two billion, three hundred three million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •