Base | Representation |
---|---|
bin | 1101101001011011111000… |
… | …01111110011000011000111 |
3 | 10221021000200122200020101212 |
4 | 12310231330033303003013 |
5 | 12413200032334410231 |
6 | 143454512301442035 |
7 | 6215140035431051 |
oct | 664557417630307 |
9 | 127230618606355 |
10 | 30011021013191 |
11 | 9620669a81419 |
12 | 344840627031b |
13 | 139904781322a |
14 | 75a780d6a8d1 |
15 | 3709c761942b |
hex | 1b4b7c3f30c7 |
30011021013191 has 8 divisors (see below), whose sum is σ = 30741175230480. Its totient is φ = 29282331500352.
The previous prime is 30011021013167. The next prime is 30011021013203. The reversal of 30011021013191 is 19131012011003.
It is a happy number.
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 30011021013191 - 214 = 30011020996807 is a prime.
It is a super-2 number, since 2×300110210131912 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30011021013091) 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, 366134636 + ... + 366216593.
It is an arithmetic number, because the mean of its divisors is an integer number (3842646903810).
Almost surely, 230011021013191 is an apocalyptic number.
30011021013191 is a deficient number, since it is larger than the sum of its proper divisors (730154217289).
30011021013191 is an equidigital number, since it uses as much as digits as its factorization.
30011021013191 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 732352225.
The product of its (nonzero) digits is 162, while the sum is 23.
Adding to 30011021013191 its reverse (19131012011003), we get a palindrome (49142033024194).
The spelling of 30011021013191 in words is "thirty trillion, eleven billion, twenty-one million, thirteen thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •