Base | Representation |
---|---|
bin | 1100000001100100111010… |
… | …1110110011101001010111 |
3 | 1201210221022021012122110112 |
4 | 3000121032232303221113 |
5 | 3213104034414330403 |
6 | 44041425504113235 |
7 | 2533126260465110 |
oct | 300311656635127 |
9 | 51727267178415 |
10 | 13221230230103 |
11 | 4238101874005 |
12 | 159644330581b |
13 | 74b9ab4cc30c |
14 | 339ca794b207 |
15 | 17ddab8849d8 |
hex | c064ebb3a57 |
13221230230103 has 32 divisors (see below), whose sum is σ = 16631422156800. Its totient is φ = 10247812302816.
The previous prime is 13221230230073. The next prime is 13221230230111. The reversal of 13221230230103 is 30103203212231.
It is a cyclic number.
It is not a de Polignac number, because 13221230230103 - 220 = 13221229181527 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13221230230183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3046301 + ... + 5976822.
It is an arithmetic number, because the mean of its divisors is an integer number (519731942400).
Almost surely, 213221230230103 is an apocalyptic number.
13221230230103 is a deficient number, since it is larger than the sum of its proper divisors (3410191926697).
13221230230103 is a wasteful number, since it uses less digits than its factorization.
13221230230103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9023651.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 13221230230103 its reverse (30103203212231), we get a palindrome (43324433442334).
The spelling of 13221230230103 in words is "thirteen trillion, two hundred twenty-one billion, two hundred thirty million, two hundred thirty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •