Base | Representation |
---|---|
bin | 1101101110111110010111… |
… | …01000000011011110001001 |
3 | 10221221012220201010011112012 |
4 | 12313133023220003132021 |
5 | 12424304311310124001 |
6 | 144122144452225305 |
7 | 6234655100443433 |
oct | 667371350033611 |
9 | 127835821104465 |
10 | 30201331333001 |
11 | 9694349210464 |
12 | 347927890b235 |
13 | 13b0c8651701a |
14 | 765a761c7653 |
15 | 37591507c2bb |
hex | 1b77cba03789 |
30201331333001 has 4 divisors (see below), whose sum is σ = 30202288829952. Its totient is φ = 30200373836052.
The previous prime is 30201331332943. The next prime is 30201331333027. The reversal of 30201331333001 is 10033313310203.
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 a de Polignac number, because none of the positive numbers 2k-30201331333001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30201331333051) 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, 478701161 + ... + 478764246.
It is an arithmetic number, because the mean of its divisors is an integer number (7550572207488).
Almost surely, 230201331333001 is an apocalyptic number.
It is an amenable number.
30201331333001 is a deficient number, since it is larger than the sum of its proper divisors (957496951).
30201331333001 is an equidigital number, since it uses as much as digits as its factorization.
30201331333001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 957496950.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 30201331333001 its reverse (10033313310203), we get a palindrome (40234644643204).
The spelling of 30201331333001 in words is "thirty trillion, two hundred one billion, three hundred thirty-one million, three hundred thirty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •