Base | Representation |
---|---|
bin | 101011101100000001110… |
… | …110001001110110000111 |
3 | 101122000020101122002001112 |
4 | 223230001312021312013 |
5 | 343142013024110343 |
6 | 10215110410115235 |
7 | 426621432260162 |
oct | 53540166116607 |
9 | 11560211562045 |
10 | 3002213113223 |
11 | a58260042475 |
12 | 405a2311bb1b |
13 | 18a1521a315c |
14 | a5444bc8ad9 |
15 | 53163ba1218 |
hex | 2bb01d89d87 |
3002213113223 has 4 divisors (see below), whose sum is σ = 3002830730328. Its totient is φ = 3001595496120.
The previous prime is 3002213113217. The next prime is 3002213113231. The reversal of 3002213113223 is 3223113122003.
3002213113223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 3002213113223 - 212 = 3002213109127 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3002213113283) 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, 308801261 + ... + 308810982.
It is an arithmetic number, because the mean of its divisors is an integer number (750707682582).
Almost surely, 23002213113223 is an apocalyptic number.
3002213113223 is a deficient number, since it is larger than the sum of its proper divisors (617617105).
3002213113223 is an equidigital number, since it uses as much as digits as its factorization.
3002213113223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 617617104.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 3002213113223 its reverse (3223113122003), we get a palindrome (6225326235226).
The spelling of 3002213113223 in words is "three trillion, two billion, two hundred thirteen million, one hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.984 sec. • engine limits •