Base | Representation |
---|---|
bin | 1101110010011111001000… |
… | …00111100011111110111111 |
3 | 10222100202101102000011021102 |
4 | 12321033210013203332333 |
5 | 12433243424320030421 |
6 | 144253422441123315 |
7 | 6246456313500251 |
oct | 671174407437677 |
9 | 128322342004242 |
10 | 30322001330111 |
11 | 97305412922a7 |
12 | 3498734a8953b |
13 | 13bc47746738a |
14 | 76b8424d7cd1 |
15 | 378b28c7a60b |
hex | 1b93e41e3fbf |
30322001330111 has 4 divisors (see below), whose sum is σ = 30322076005512. Its totient is φ = 30321926654712.
The previous prime is 30322001329987. The next prime is 30322001330119. The reversal of 30322001330111 is 11103310022303.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 30322001330111 - 214 = 30322001313727 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30322001330119) 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 3 ways as a sum of consecutive naturals, for example, 36725276 + ... + 37541841.
It is an arithmetic number, because the mean of its divisors is an integer number (7580519001378).
Almost surely, 230322001330111 is an apocalyptic number.
30322001330111 is a deficient number, since it is larger than the sum of its proper divisors (74675401).
30322001330111 is an equidigital number, since it uses as much as digits as its factorization.
30322001330111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74675400.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 30322001330111 its reverse (11103310022303), we get a palindrome (41425311352414).
The spelling of 30322001330111 in words is "thirty trillion, three hundred twenty-two billion, one million, three hundred thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •