Base | Representation |
---|---|
bin | 1101011001001100011… |
… | …0110110001000000011 |
3 | 210222221011012202210221 |
4 | 3112103012312020003 |
5 | 12232221413441003 |
6 | 253412421403511 |
7 | 22424060611063 |
oct | 3262306661003 |
9 | 728834182727 |
10 | 230101312003 |
11 | 89649212462 |
12 | 38718569597 |
13 | 18910696cb4 |
14 | b1cbb7d3a3 |
15 | 5ebae117bd |
hex | 35931b6203 |
230101312003 has 8 divisors (see below), whose sum is σ = 231010380288. Its totient is φ = 229192920264.
The previous prime is 230101311997. The next prime is 230101312069. The reversal of 230101312003 is 300213101032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-230101312003 is a prime.
It is a super-2 number, since 2×2301013120032 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (230101313003) 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 7 ways as a sum of consecutive naturals, for example, 517926 + ... + 853492.
It is an arithmetic number, because the mean of its divisors is an integer number (28876297536).
Almost surely, 2230101312003 is an apocalyptic number.
230101312003 is a deficient number, since it is larger than the sum of its proper divisors (909068285).
230101312003 is a wasteful number, since it uses less digits than its factorization.
230101312003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 338273.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 230101312003 its reverse (300213101032), we get a palindrome (530314413035).
The spelling of 230101312003 in words is "two hundred thirty billion, one hundred one million, three hundred twelve thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •