Base | Representation |
---|---|
bin | 1100000000011010011010… |
… | …1111110011111100110111 |
3 | 1201202000200120002221102022 |
4 | 3000012212233303330313 |
5 | 3212242110401131043 |
6 | 44024321241503355 |
7 | 2531520556666661 |
oct | 300064657637467 |
9 | 51660616087368 |
10 | 13201232052023 |
11 | 422a67a379904 |
12 | 15925a1aa1b5b |
13 | 749b42311a52 |
14 | 338d2b9bb531 |
15 | 17d5dad78868 |
hex | c01a6bf3f37 |
13201232052023 has 8 divisors (see below), whose sum is σ = 13430791052160. Its totient is φ = 12971866695480.
The previous prime is 13201232051957. The next prime is 13201232052061. The reversal of 13201232052023 is 32025023210231.
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 13201232052023 - 28 = 13201232051767 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13201232051983 and 13201232052001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13201232052523) 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, 48273365 + ... + 48546062.
It is an arithmetic number, because the mean of its divisors is an integer number (1678848881520).
Almost surely, 213201232052023 is an apocalyptic number.
13201232052023 is a deficient number, since it is larger than the sum of its proper divisors (229559000137).
13201232052023 is an equidigital number, since it uses as much as digits as its factorization.
13201232052023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96821797.
The product of its (nonzero) digits is 4320, while the sum is 26.
Adding to 13201232052023 its reverse (32025023210231), we get a palindrome (45226255262254).
The spelling of 13201232052023 in words is "thirteen trillion, two hundred one billion, two hundred thirty-two million, fifty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •