Base | Representation |
---|---|
bin | 10111011111101011011100… |
… | …011010110110000110001101 |
3 | 111112212110000020002221220222 |
4 | 113133223130122312012031 |
5 | 102020442434413411023 |
6 | 1003434024125321125 |
7 | 30523330546252400 |
oct | 2737533432660615 |
9 | 445773006087828 |
10 | 103332021232013 |
11 | 2aa19956141762 |
12 | b70a530a061a5 |
13 | 4587224838cc2 |
14 | 1b734218b9d37 |
15 | be2d829a4cc8 |
hex | 5dfadc6b618d |
103332021232013 has 24 divisors (see below), whose sum is σ = 120843423429120. Its totient is φ = 88098222481920.
The previous prime is 103332021232009. The next prime is 103332021232019. The reversal of 103332021232013 is 310232120233301.
It is not a de Polignac number, because 103332021232013 - 22 = 103332021232009 is a prime.
It is a super-2 number, since 2×1033320212320132 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103332021232019) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 62728478 + ... + 64354688.
It is an arithmetic number, because the mean of its divisors is an integer number (5035142642880).
Almost surely, 2103332021232013 is an apocalyptic number.
It is an amenable number.
103332021232013 is a deficient number, since it is larger than the sum of its proper divisors (17511402197107).
103332021232013 is a wasteful number, since it uses less digits than its factorization.
103332021232013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1633137 (or 1633130 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 103332021232013 its reverse (310232120233301), we get a palindrome (413564141465314).
The spelling of 103332021232013 in words is "one hundred three trillion, three hundred thirty-two billion, twenty-one million, two hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •