Base | Representation |
---|---|
bin | 101100000101110100001… |
… | …000000010100000001111 |
3 | 101201122200221210020010112 |
4 | 230011310020002200033 |
5 | 344120213423130033 |
6 | 10235530020430235 |
7 | 431621515555424 |
oct | 54056410024017 |
9 | 11648627706115 |
10 | 3029900208143 |
11 | a68a787506a6 |
12 | 40b26b54837b |
13 | 18c945325163 |
14 | a690dda5d4b |
15 | 53c34709c48 |
hex | 2c17420280f |
3029900208143 has 4 divisors (see below), whose sum is σ = 3041163777960. Its totient is φ = 3018636638328.
The previous prime is 3029900208113. The next prime is 3029900208199. The reversal of 3029900208143 is 3418020099203.
3029900208143 is digitally balanced in base 3, 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 3029900208143 - 26 = 3029900208079 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 3029900208143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3029900208113) 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, 5631784505 + ... + 5631785042.
It is an arithmetic number, because the mean of its divisors is an integer number (760290944490).
Almost surely, 23029900208143 is an apocalyptic number.
3029900208143 is a deficient number, since it is larger than the sum of its proper divisors (11263569817).
3029900208143 is a wasteful number, since it uses less digits than its factorization.
3029900208143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11263569816.
The product of its (nonzero) digits is 93312, while the sum is 41.
The spelling of 3029900208143 in words is "three trillion, twenty-nine billion, nine hundred million, two hundred eight thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •