Base | Representation |
---|---|
bin | 1100000010000101110010… |
… | …0111111001011000011011 |
3 | 1201211210002011020200202011 |
4 | 3000201130213321120123 |
5 | 3213230122111443303 |
6 | 44045445203450351 |
7 | 2533561024002121 |
oct | 300413447713033 |
9 | 51753064220664 |
10 | 13230053234203 |
11 | 424091a164633 |
12 | 15980a60869b7 |
13 | 74c7863babc0 |
14 | 33a4a364b911 |
15 | 17e22624d16d |
hex | c085c9f961b |
13230053234203 has 8 divisors (see below), whose sum is σ = 14380906177008. Its totient is φ = 12098222654304.
The previous prime is 13230053234107. The next prime is 13230053234207. The reversal of 13230053234203 is 30243235003231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13230053234203 - 213 = 13230053226011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13230053234207) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4755589276 + ... + 4755592057.
It is an arithmetic number, because the mean of its divisors is an integer number (1797613272126).
Almost surely, 213230053234203 is an apocalyptic number.
13230053234203 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
13230053234203 is a deficient number, since it is larger than the sum of its proper divisors (1150852942805).
13230053234203 is a wasteful number, since it uses less digits than its factorization.
13230053234203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9511181453.
The product of its (nonzero) digits is 38880, while the sum is 31.
Adding to 13230053234203 its reverse (30243235003231), we get a palindrome (43473288237434).
The spelling of 13230053234203 in words is "thirteen trillion, two hundred thirty billion, fifty-three million, two hundred thirty-four thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •