Base | Representation |
---|---|
bin | 11101001000101101000… |
… | …001111001111101011011 |
3 | 21002102001110210101022010 |
4 | 131020231001321331123 |
5 | 230301011304443303 |
6 | 4131445214001003 |
7 | 264440431120404 |
oct | 35105501717533 |
9 | 7072043711263 |
10 | 2002210234203 |
11 | 702150530523 |
12 | 2840601a6163 |
13 | 116a6643a06a |
14 | 6cc9c2329ab |
15 | 3713706bc03 |
hex | 1d22d079f5b |
2002210234203 has 16 divisors (see below), whose sum is σ = 2737726903296. Its totient is φ = 1300985880960.
The previous prime is 2002210234201. The next prime is 2002210234253. The reversal of 2002210234203 is 3024320122002.
It is not a de Polignac number, because 2002210234203 - 21 = 2002210234201 is a prime.
It is a super-2 number, since 2×20022102342032 (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 2002210234203.
It is not an unprimeable number, because it can be changed into a prime (2002210234201) 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 in 15 ways as a sum of consecutive naturals, for example, 29426751 + ... + 29494712.
It is an arithmetic number, because the mean of its divisors is an integer number (171107931456).
Almost surely, 22002210234203 is an apocalyptic number.
2002210234203 is a deficient number, since it is larger than the sum of its proper divisors (735516669093).
2002210234203 is a wasteful number, since it uses less digits than its factorization.
2002210234203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58921754.
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 2002210234203 its reverse (3024320122002), we get a palindrome (5026530356205).
The spelling of 2002210234203 in words is "two trillion, two billion, two hundred ten million, two hundred thirty-four thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •