Base | Representation |
---|---|
bin | 101100000101111011011… |
… | …001111001011101100101 |
3 | 101201200000110120200010011 |
4 | 230011323121321131211 |
5 | 344120441204031323 |
6 | 10235550102130221 |
7 | 431624530565434 |
oct | 54057331713545 |
9 | 11650013520104 |
10 | 3030022330213 |
11 | a6903068182a |
12 | 40b2a4420971 |
13 | 18c964712c38 |
14 | a69222b511b |
15 | 53c402ce20d |
hex | 2c17b679765 |
3030022330213 has 4 divisors (see below), whose sum is σ = 3050358050700. Its totient is φ = 3009686609728.
The previous prime is 3030022330211. The next prime is 3030022330219. The reversal of 3030022330213 is 3120332200303.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1932719989729 + 1097302340484 = 1390223^2 + 1047522^2 .
It is a cyclic number.
It is not a de Polignac number, because 3030022330213 - 21 = 3030022330211 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 (3030022330211) 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, 10167860020 + ... + 10167860317.
It is an arithmetic number, because the mean of its divisors is an integer number (762589512675).
Almost surely, 23030022330213 is an apocalyptic number.
It is an amenable number.
3030022330213 is a deficient number, since it is larger than the sum of its proper divisors (20335720487).
3030022330213 is a wasteful number, since it uses less digits than its factorization.
3030022330213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20335720486.
The product of its (nonzero) digits is 1944, while the sum is 22.
Adding to 3030022330213 its reverse (3120332200303), we get a palindrome (6150354530516).
The spelling of 3030022330213 in words is "three trillion, thirty billion, twenty-two million, three hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •