Base | Representation |
---|---|
bin | 11000001110000110… |
… | …10001101001100011 |
3 | 1020120012211001120121 |
4 | 30013003101221203 |
5 | 203112304413443 |
6 | 5550143421111 |
7 | 640142246233 |
oct | 140703215143 |
9 | 36505731517 |
10 | 13003201123 |
11 | 5572a71510 |
12 | 262a8b4797 |
13 | 12c2c52a63 |
14 | 8b4d5dcc3 |
15 | 5118854ed |
hex | 3070d1a63 |
13003201123 has 4 divisors (see below), whose sum is σ = 14185310328. Its totient is φ = 11821091920.
The previous prime is 13003201121. The next prime is 13003201129. The reversal of 13003201123 is 32110230031.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 13003201123 - 21 = 13003201121 is a prime.
It is a super-2 number, since 2×130032011232 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13003201097 and 13003201106.
It is not an unprimeable number, because it can be changed into a prime (13003201121) 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, 591054586 + ... + 591054607.
It is an arithmetic number, because the mean of its divisors is an integer number (3546327582).
Almost surely, 213003201123 is an apocalyptic number.
13003201123 is a deficient number, since it is larger than the sum of its proper divisors (1182109205).
13003201123 is a wasteful number, since it uses less digits than its factorization.
13003201123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1182109204.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 13003201123 its reverse (32110230031), we get a palindrome (45113431154).
The spelling of 13003201123 in words is "thirteen billion, three million, two hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •