Base | Representation |
---|---|
bin | 1101101001111111011101… |
… | …01001111010111110010001 |
3 | 10221022211222201102012222110 |
4 | 12310333232221322332101 |
5 | 12414003141301130301 |
6 | 143511351414255533 |
7 | 6216414243114552 |
oct | 664775651727621 |
9 | 127284881365873 |
10 | 30030120333201 |
11 | 962878005420a |
12 | 34500566575a9 |
13 | 139aa9c716b11 |
14 | 75b67379a329 |
15 | 3712442720d6 |
hex | 1b4feea7af91 |
30030120333201 has 8 divisors (see below), whose sum is σ = 40153588662240. Its totient is φ = 19963366113152.
The previous prime is 30030120333131. The next prime is 30030120333209. The reversal of 30030120333201 is 10233302103003.
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 30030120333201 - 226 = 30030053224337 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (30030120333209) 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 7 ways as a sum of consecutive naturals, for example, 14178526011 + ... + 14178528128.
It is an arithmetic number, because the mean of its divisors is an integer number (5019198582780).
Almost surely, 230030120333201 is an apocalyptic number.
It is an amenable number.
30030120333201 is a deficient number, since it is larger than the sum of its proper divisors (10123468329039).
30030120333201 is a wasteful number, since it uses less digits than its factorization.
30030120333201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28357054495.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 30030120333201 its reverse (10233302103003), we get a palindrome (40263422436204).
The spelling of 30030120333201 in words is "thirty trillion, thirty billion, one hundred twenty million, three hundred thirty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •