Base | Representation |
---|---|
bin | 1101101111010010011110… |
… | …10001110001111111010011 |
3 | 10221222020210021202101001211 |
4 | 12313221033101301333103 |
5 | 12424443420241140311 |
6 | 144131132205440551 |
7 | 6235516513666666 |
oct | 667511721617723 |
9 | 127866707671054 |
10 | 30212130021331 |
11 | 969898a84a875 |
12 | 347b391270157 |
13 | 13b1cb781832b |
14 | 7663bc4536dd |
15 | 375d48103821 |
hex | 1b7a4f471fd3 |
30212130021331 has 4 divisors (see below), whose sum is σ = 30217032206632. Its totient is φ = 30207227836032.
The previous prime is 30212130021329. The next prime is 30212130021377. The reversal of 30212130021331 is 13312003121203.
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 30212130021331 - 21 = 30212130021329 is a prime.
It is a super-2 number, since 2×302121300213312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30212130021631) 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, 2451083406 + ... + 2451095731.
It is an arithmetic number, because the mean of its divisors is an integer number (7554258051658).
Almost surely, 230212130021331 is an apocalyptic number.
30212130021331 is a deficient number, since it is larger than the sum of its proper divisors (4902185301).
30212130021331 is an equidigital number, since it uses as much as digits as its factorization.
30212130021331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4902185300.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 30212130021331 its reverse (13312003121203), we get a palindrome (43524133142534).
The spelling of 30212130021331 in words is "thirty trillion, two hundred twelve billion, one hundred thirty million, twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •