Base | Representation |
---|---|
bin | 1101101110111110010101… |
… | …11100111100101011101001 |
3 | 10221221012212220212001211200 |
4 | 12313133022330330223221 |
5 | 12424304300412024001 |
6 | 144122143410114413 |
7 | 6234654602421015 |
oct | 667371274745351 |
9 | 127835786761750 |
10 | 30201320033001 |
11 | 96943428a2617 |
12 | 3479274b7ba09 |
13 | 13b0c8408b830 |
14 | 765a748c5545 |
15 | 375914099086 |
hex | 1b77caf3cae9 |
30201320033001 has 48 divisors (see below), whose sum is σ = 47337791032896. Its totient is φ = 18444210115968.
The previous prime is 30201320032997. The next prime is 30201320033009. The reversal of 30201320033001 is 10033002310203.
30201320033001 is a `hidden beast` number, since 302 + 0 + 1 + 32 + 0 + 0 + 330 + 0 + 1 = 666.
It is not a de Polignac number, because 30201320033001 - 22 = 30201320032997 is a prime.
It is not an unprimeable number, because it can be changed into a prime (30201320033009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 9707946 + ... + 12435708.
It is an arithmetic number, because the mean of its divisors is an integer number (986203979852).
Almost surely, 230201320033001 is an apocalyptic number.
It is an amenable number.
30201320033001 is a deficient number, since it is larger than the sum of its proper divisors (17136470999895).
30201320033001 is a wasteful number, since it uses less digits than its factorization.
30201320033001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2728502 (or 2728499 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 30201320033001 its reverse (10033002310203), we get a palindrome (40234322343204).
The spelling of 30201320033001 in words is "thirty trillion, two hundred one billion, three hundred twenty million, thirty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •