Base | Representation |
---|---|
bin | 1101110010001100110111… |
… | …11110010100000000001101 |
3 | 10222022211002101222101010102 |
4 | 12321012123332110000031 |
5 | 12433113341424324323 |
6 | 144245122150220445 |
7 | 6245661412244042 |
oct | 671063376240015 |
9 | 128284071871112 |
10 | 30312201011213 |
11 | 97273722626a0 |
12 | 349685a954725 |
13 | 13bb574c52004 |
14 | 76b192ab31c9 |
15 | 3787536b2328 |
hex | 1b919bf9400d |
30312201011213 has 4 divisors (see below), whose sum is σ = 33067855648608. Its totient is φ = 27556546373820.
The previous prime is 30312201011173. The next prime is 30312201011221. The reversal of 30312201011213 is 31211010221303.
It is a happy number.
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 not a de Polignac number, because 30312201011213 - 244 = 12720014966797 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30312201011293) 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, 1377827318681 + ... + 1377827318702.
It is an arithmetic number, because the mean of its divisors is an integer number (8266963912152).
Almost surely, 230312201011213 is an apocalyptic number.
It is an amenable number.
30312201011213 is a deficient number, since it is larger than the sum of its proper divisors (2755654637395).
30312201011213 is a wasteful number, since it uses less digits than its factorization.
30312201011213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2755654637394.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 30312201011213 its reverse (31211010221303), we get a palindrome (61523211232516).
The spelling of 30312201011213 in words is "thirty trillion, three hundred twelve billion, two hundred one million, eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •