Base | Representation |
---|---|
bin | 11100001000110101… |
… | …110101000111100001 |
3 | 2212222121021111121202 |
4 | 130020311311013201 |
5 | 443334023200001 |
6 | 21514003330545 |
7 | 2116465053440 |
oct | 341065650741 |
9 | 85877244552 |
10 | 30213100001 |
11 | 118a4564237 |
12 | 5a32380a55 |
13 | 2b06587c86 |
14 | 166887ad57 |
15 | bbc6be96b |
hex | 708d751e1 |
30213100001 has 4 divisors (see below), whose sum is σ = 34529257152. Its totient is φ = 25896942852.
The previous prime is 30213099979. The next prime is 30213100013. The reversal of 30213100001 is 10000131203.
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, and also an emirpimes, since its reverse is a distinct semiprime: 10000131203 = 47 ⋅212768749.
It is a cyclic number.
It is not a de Polignac number, because 30213100001 - 218 = 30212837857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30213100051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2158078565 + ... + 2158078578.
It is an arithmetic number, because the mean of its divisors is an integer number (8632314288).
Almost surely, 230213100001 is an apocalyptic number.
It is an amenable number.
30213100001 is a deficient number, since it is larger than the sum of its proper divisors (4316157151).
30213100001 is an equidigital number, since it uses as much as digits as its factorization.
30213100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4316157150.
The product of its (nonzero) digits is 18, while the sum is 11.
Adding to 30213100001 its reverse (10000131203), we get a palindrome (40213231204).
The spelling of 30213100001 in words is "thirty billion, two hundred thirteen million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •