Base | Representation |
---|---|
bin | 101100000110000110000… |
… | …000111011000001111101 |
3 | 101201200110212112010020020 |
4 | 230012012000323001331 |
5 | 344121322241114123 |
6 | 10240015501242353 |
7 | 431632121563332 |
oct | 54060600730175 |
9 | 11650425463206 |
10 | 3030200332413 |
11 | a691120aa491 |
12 | 40b333b633b9 |
13 | 18c992567697 |
14 | a693bbac989 |
15 | 53c50c407e3 |
hex | 2c18603b07d |
3030200332413 has 8 divisors (see below), whose sum is σ = 4051098926688. Its totient is φ = 2014717646544.
The previous prime is 3030200332387. The next prime is 3030200332441. The reversal of 3030200332413 is 3142330020303.
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 3030200332413 - 217 = 3030200201341 is a prime.
It is a super-2 number, since 2×30302003324132 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3030200332013) 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, 1353975795 + ... + 1353978032.
It is an arithmetic number, because the mean of its divisors is an integer number (506387365836).
Almost surely, 23030200332413 is an apocalyptic number.
It is an amenable number.
3030200332413 is a deficient number, since it is larger than the sum of its proper divisors (1020898594275).
3030200332413 is a wasteful number, since it uses less digits than its factorization.
3030200332413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2707954203.
The product of its (nonzero) digits is 3888, while the sum is 24.
Adding to 3030200332413 its reverse (3142330020303), we get a palindrome (6172530352716).
The spelling of 3030200332413 in words is "three trillion, thirty billion, two hundred million, three hundred thirty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •