Base | Representation |
---|---|
bin | 1101111111001101111110… |
… | …11011000001100100000001 |
3 | 11000220120120111220000102201 |
4 | 12333212333123001210001 |
5 | 13012430344404323301 |
6 | 145230412335113201 |
7 | 6323204253636604 |
oct | 677467733014401 |
9 | 130816514800381 |
10 | 30759472339201 |
11 | 988a023268401 |
12 | 3549485072801 |
13 | 14217b4c17c38 |
14 | 784aa302c33b |
15 | 3851d0105201 |
hex | 1bf9bf6c1901 |
30759472339201 has 4 divisors (see below), whose sum is σ = 30764050329600. Its totient is φ = 30754894348804.
The previous prime is 30759472339177. The next prime is 30759472339223. The reversal of 30759472339201 is 10293327495703.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 30759472339201 - 233 = 30750882404609 is a prime.
It is a super-2 number, since 2×307594723392012 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30759472339801) 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, 2288985121 + ... + 2288998558.
It is an arithmetic number, because the mean of its divisors is an integer number (7691012582400).
Almost surely, 230759472339201 is an apocalyptic number.
It is an amenable number.
30759472339201 is a deficient number, since it is larger than the sum of its proper divisors (4577990399).
30759472339201 is an equidigital number, since it uses as much as digits as its factorization.
30759472339201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4577990398.
The product of its (nonzero) digits is 8573040, while the sum is 55.
The spelling of 30759472339201 in words is "thirty trillion, seven hundred fifty-nine billion, four hundred seventy-two million, three hundred thirty-nine thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •