Base | Representation |
---|---|
bin | 11100000100101011… |
… | …010011100011001011 |
3 | 2212210201210212000112 |
4 | 130010223103203023 |
5 | 443213131412303 |
6 | 21503030024535 |
7 | 2114656150310 |
oct | 340453234313 |
9 | 85721725015 |
10 | 30143232203 |
11 | 11869083557 |
12 | 5a12aa814b |
13 | 2ac4c64696 |
14 | 165d490d07 |
15 | bb64bd0d8 |
hex | 704ad38cb |
30143232203 has 4 divisors (see below), whose sum is σ = 34449408240. Its totient is φ = 25837056168.
The previous prime is 30143232193. The next prime is 30143232239. The reversal of 30143232203 is 30223234103.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 30223234103 = 431 ⋅70123513.
It is not a de Polignac number, because 30143232203 - 218 = 30142970059 is a prime.
It is a super-2 number, since 2×301432322032 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30143232283) 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, 2153088008 + ... + 2153088021.
It is an arithmetic number, because the mean of its divisors is an integer number (8612352060).
Almost surely, 230143232203 is an apocalyptic number.
30143232203 is a deficient number, since it is larger than the sum of its proper divisors (4306176037).
30143232203 is an equidigital number, since it uses as much as digits as its factorization.
30143232203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4306176036.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 30143232203 its reverse (30223234103), we get a palindrome (60366466306).
The spelling of 30143232203 in words is "thirty billion, one hundred forty-three million, two hundred thirty-two thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •