Base | Representation |
---|---|
bin | 10111001100010110000000… |
… | …010000011010101100101101 |
3 | 111101011102102110022222200022 |
4 | 113030112000100122230231 |
5 | 101332210310001200023 |
6 | 1000535403303211525 |
7 | 30325332416055566 |
oct | 2714260020325455 |
9 | 441142373288608 |
10 | 102003330100013 |
11 | 2a557407690431 |
12 | b534b18a46ba5 |
13 | 44bbb4659aca4 |
14 | 1b28db7a7516d |
15 | bbd519ce87c8 |
hex | 5cc58041ab2d |
102003330100013 has 16 divisors (see below), whose sum is σ = 103782527516736. Its totient is φ = 100234861499520.
The previous prime is 102003330099991. The next prime is 102003330100027. The reversal of 102003330100013 is 310001033300201.
It is a cyclic number.
It is not a de Polignac number, because 102003330100013 - 26 = 102003330099949 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 102003330099964 and 102003330100000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102003330100043) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 34661606 + ... + 37489112.
It is an arithmetic number, because the mean of its divisors is an integer number (6486407969796).
Almost surely, 2102003330100013 is an apocalyptic number.
It is an amenable number.
102003330100013 is a deficient number, since it is larger than the sum of its proper divisors (1779197416723).
102003330100013 is a wasteful number, since it uses less digits than its factorization.
102003330100013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2829404.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 102003330100013 its reverse (310001033300201), we get a palindrome (412004363400214).
The spelling of 102003330100013 in words is "one hundred two trillion, three billion, three hundred thirty million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •