Base | Representation |
---|---|
bin | 1001001011111001011011… |
… | …11101001111011110110011 |
3 | 2122112002201212221002011120 |
4 | 10211330231331033132303 |
5 | 10121424101032101003 |
6 | 110543430343513323 |
7 | 4153254612612012 |
oct | 445745575173663 |
9 | 78462655832146 |
10 | 20200002222003 |
11 | 64888557066aa |
12 | 2322a8ba58843 |
13 | b36b0cc003b6 |
14 | 4db98475aa79 |
15 | 2506ad5e8853 |
hex | 125f2df4f7b3 |
20200002222003 has 8 divisors (see below), whose sum is σ = 27389833521600. Its totient is φ = 13238419535208.
The previous prime is 20200002221891. The next prime is 20200002222007. The reversal of 20200002222003 is 30022220000202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20200002222003 - 29 = 20200002221491 is a prime.
It is a super-2 number, since 2×202000022220032 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20200002222007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 57062152993 + ... + 57062153346.
It is an arithmetic number, because the mean of its divisors is an integer number (3423729190200).
Almost surely, 220200002222003 is an apocalyptic number.
20200002222003 is a deficient number, since it is larger than the sum of its proper divisors (7189831299597).
20200002222003 is a wasteful number, since it uses less digits than its factorization.
20200002222003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114124306401.
The product of its (nonzero) digits is 192, while the sum is 15.
Adding to 20200002222003 its reverse (30022220000202), we get a palindrome (50222222222205).
The spelling of 20200002222003 in words is "twenty trillion, two hundred billion, two million, two hundred twenty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •