Base | Representation |
---|---|
bin | 1011110101111111110110… |
… | …1000011001100001000111 |
3 | 1201002220211112221210102222 |
4 | 2331133331220121201013 |
5 | 3201324133040200403 |
6 | 43410210150322555 |
7 | 2512554522001061 |
oct | 275377550314107 |
9 | 51086745853388 |
10 | 13022301100103 |
11 | 41707aa531339 |
12 | 156398635945b |
13 | 735cc8001b39 |
14 | 3303d5b84731 |
15 | 178b17440338 |
hex | bd7fda19847 |
13022301100103 has 8 divisors (see below), whose sum is σ = 13034667016800. Its totient is φ = 13009939735968.
The previous prime is 13022301100087. The next prime is 13022301100117. The reversal of 13022301100103 is 30100110322031.
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 13022301100103 - 24 = 13022301100087 is a prime.
It is a super-2 number, since 2×130223011001032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13022301100183) 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, 4599158 + ... + 6869996.
It is an arithmetic number, because the mean of its divisors is an integer number (1629333377100).
Almost surely, 213022301100103 is an apocalyptic number.
13022301100103 is a deficient number, since it is larger than the sum of its proper divisors (12365916697).
13022301100103 is a wasteful number, since it uses less digits than its factorization.
13022301100103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2276281.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 13022301100103 its reverse (30100110322031), we get a palindrome (43122411422134).
The spelling of 13022301100103 in words is "thirteen trillion, twenty-two billion, three hundred one million, one hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.182 sec. • engine limits •