Base | Representation |
---|---|
bin | 101100000110000111110… |
… | …010001011011111010101 |
3 | 101201200112221101111211022 |
4 | 230012013302023133111 |
5 | 344121402341201401 |
6 | 10240022441450525 |
7 | 431632632130232 |
oct | 54060762133725 |
9 | 11650487344738 |
10 | 3030230022101 |
11 | a69127938817 |
12 | 40b341aa0a45 |
13 | 18c998761349 |
14 | a6941ada789 |
15 | 53c5365771b |
hex | 2c187c8b7d5 |
3030230022101 has 8 divisors (see below), whose sum is σ = 3076536731520. Its totient is φ = 2984156596512.
The previous prime is 3030230022067. The next prime is 3030230022109. The reversal of 3030230022101 is 1012200320303.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3030230022101 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 3030230022101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3030230022109) 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, 58294781 + ... + 58346738.
It is an arithmetic number, because the mean of its divisors is an integer number (384567091440).
Almost surely, 23030230022101 is an apocalyptic number.
It is an amenable number.
3030230022101 is a deficient number, since it is larger than the sum of its proper divisors (46306709419).
3030230022101 is a wasteful number, since it uses less digits than its factorization.
3030230022101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 116641915.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 3030230022101 its reverse (1012200320303), we get a palindrome (4042430342404).
The spelling of 3030230022101 in words is "three trillion, thirty billion, two hundred thirty million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •