Base | Representation |
---|---|
bin | 1011110101111100001000… |
… | …0010000110000100011110 |
3 | 1201002211020212110202210110 |
4 | 2331133002002012010132 |
5 | 3201320111102000410 |
6 | 43405523031150450 |
7 | 2512520661006615 |
oct | 275370202060436 |
9 | 51084225422713 |
10 | 13021301203230 |
11 | 4170337078a91 |
12 | 1563747515426 |
13 | 735b98acc898 |
14 | 33033d06287c |
15 | 178aa977e720 |
hex | bd7c208611e |
13021301203230 has 64 divisors (see below), whose sum is σ = 31580254052928. Its totient is φ = 3435792629760.
The previous prime is 13021301203223. The next prime is 13021301203231. The reversal of 13021301203230 is 3230210312031.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13021301203197 and 13021301203206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13021301203231) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12781974 + ... + 13763046.
It is an arithmetic number, because the mean of its divisors is an integer number (493441469577).
Almost surely, 213021301203230 is an apocalyptic number.
13021301203230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13021301203230 is an abundant number, since it is smaller than the sum of its proper divisors (18558952849698).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13021301203230 is a wasteful number, since it uses less digits than its factorization.
13021301203230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 985741.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 13021301203230 its reverse (3230210312031), we get a palindrome (16251511515261).
The spelling of 13021301203230 in words is "thirteen trillion, twenty-one billion, three hundred one million, two hundred three thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •