Base | Representation |
---|---|
bin | 11101001000101101100… |
… | …111101010001111111011 |
3 | 21002102002011102012121010 |
4 | 131020231213222033323 |
5 | 230301021323200243 |
6 | 4131450210045003 |
7 | 264440611211106 |
oct | 35105547521773 |
9 | 7072064365533 |
10 | 2002220131323 |
11 | 702156080365 |
12 | 284063579763 |
13 | 116a684c3b49 |
14 | 6cc9d68b73d |
15 | 37137d74433 |
hex | 1d22d9ea3fb |
2002220131323 has 8 divisors (see below), whose sum is σ = 2669690363200. Its totient is φ = 1334781660168.
The previous prime is 2002220131313. The next prime is 2002220131339. The reversal of 2002220131323 is 3231310222002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2002220131323 - 25 = 2002220131291 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2002220131323.
It is not an unprimeable number, because it can be changed into a prime (2002220131313) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7792693 + ... + 8045526.
It is an arithmetic number, because the mean of its divisors is an integer number (333711295400).
Almost surely, 22002220131323 is an apocalyptic number.
2002220131323 is a deficient number, since it is larger than the sum of its proper divisors (667470231877).
2002220131323 is a wasteful number, since it uses less digits than its factorization.
2002220131323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15880361.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 2002220131323 its reverse (3231310222002), we get a palindrome (5233530353325).
The spelling of 2002220131323 in words is "two trillion, two billion, two hundred twenty million, one hundred thirty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •