Base | Representation |
---|---|
bin | 1100000000011110011010… |
… | …0010100110010010100111 |
3 | 1201202010110011000200211020 |
4 | 3000013212202212102213 |
5 | 3212301303344030043 |
6 | 44025015353342223 |
7 | 2531556234133002 |
oct | 300074642462247 |
9 | 51663404020736 |
10 | 13202302330023 |
11 | 4230079533584 |
12 | 1592840407973 |
13 | 749c82c87141 |
14 | 338dcdbc0539 |
15 | 17d64ecdce83 |
hex | c01e68a64a7 |
13202302330023 has 16 divisors (see below), whose sum is σ = 18056682798336. Its totient is φ = 8575306228160.
The previous prime is 13202302329961. The next prime is 13202302330033. The reversal of 13202302330023 is 32003320320231.
It is a cyclic number.
It is not a de Polignac number, because 13202302330023 - 28 = 13202302329767 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13202302329975 and 13202302330002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13202302330033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 72139965 + ... + 72322742.
It is an arithmetic number, because the mean of its divisors is an integer number (1128542674896).
Almost surely, 213202302330023 is an apocalyptic number.
13202302330023 is a deficient number, since it is larger than the sum of its proper divisors (4854380468313).
13202302330023 is a wasteful number, since it uses less digits than its factorization.
13202302330023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144463494.
The product of its (nonzero) digits is 3888, while the sum is 24.
Adding to 13202302330023 its reverse (32003320320231), we get a palindrome (45205622650254).
The spelling of 13202302330023 in words is "thirteen trillion, two hundred two billion, three hundred two million, three hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •