Base | Representation |
---|---|
bin | 101100000110000000001… |
… | …010111101111001011111 |
3 | 101201200020001001200012102 |
4 | 230012000022331321133 |
5 | 344121122142133203 |
6 | 10240002040155315 |
7 | 431626521414266 |
oct | 54060012757137 |
9 | 11650201050172 |
10 | 3030102302303 |
11 | a69071833a6a |
12 | 40b307168b3b |
13 | 18c9781636bb |
14 | a692cb715dd |
15 | 53c47329888 |
hex | 2c1802bde5f |
3030102302303 has 8 divisors (see below), whose sum is σ = 3247301175648. Its totient is φ = 2820024703584.
The previous prime is 3030102302291. The next prime is 3030102302371. The reversal of 3030102302303 is 3032032010303.
3030102302303 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3030102302303 - 24 = 3030102302287 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 (3030102302603) 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, 1780317776 + ... + 1780319477.
It is an arithmetic number, because the mean of its divisors is an integer number (405912646956).
Almost surely, 23030102302303 is an apocalyptic number.
3030102302303 is a deficient number, since it is larger than the sum of its proper divisors (217198873345).
3030102302303 is a wasteful number, since it uses less digits than its factorization.
3030102302303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3560637313.
The product of its (nonzero) digits is 972, while the sum is 20.
Adding to 3030102302303 its reverse (3032032010303), we get a palindrome (6062134312606).
The spelling of 3030102302303 in words is "three trillion, thirty billion, one hundred two million, three hundred two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •