Base | Representation |
---|---|
bin | 1101101100100111001111… |
… | …11000110110100111010101 |
3 | 10221122110111121022100001100 |
4 | 12312103213320312213111 |
5 | 12421442132441321323 |
6 | 144021010202220313 |
7 | 6226053443143011 |
oct | 666234770664725 |
9 | 127573447270040 |
10 | 30120201120213 |
11 | 96629a6333826 |
12 | 34655b64b4699 |
13 | 13a64271b3759 |
14 | 761b7b2c7541 |
15 | 37376775a943 |
hex | 1b64e7e369d5 |
30120201120213 has 12 divisors (see below), whose sum is σ = 43510851255820. Its totient is φ = 20078336811456.
The previous prime is 30120201120209. The next prime is 30120201120223. The reversal of 30120201120213 is 31202110202103.
30120201120213 is a `hidden beast` number, since 301 + 20 + 20 + 112 + 0 + 213 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 4767838197444 + 25352362922769 = 2183538^2 + 5035113^2 .
It is not a de Polignac number, because 30120201120213 - 22 = 30120201120209 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 (30120201120223) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 149666248 + ... + 149867361.
Almost surely, 230120201120213 is an apocalyptic number.
It is an amenable number.
30120201120213 is a deficient number, since it is larger than the sum of its proper divisors (13390650135607).
30120201120213 is a wasteful number, since it uses less digits than its factorization.
30120201120213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 299544788 (or 299544785 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 30120201120213 its reverse (31202110202103), we get a palindrome (61322311322316).
The spelling of 30120201120213 in words is "thirty trillion, one hundred twenty billion, two hundred one million, one hundred twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •