Base | Representation |
---|---|
bin | 10111011100110010011001… |
… | …100011110000111101111101 |
3 | 111112011110011011101102222221 |
4 | 113130302121203300331331 |
5 | 102004214030214014323 |
6 | 1003202444224205341 |
7 | 30503065041204442 |
oct | 2734623143607575 |
9 | 445143134342887 |
10 | 103133331001213 |
11 | 2a952666740547 |
12 | b697b1ba69851 |
13 | 457157b9955b6 |
14 | 1b6797373d9c9 |
15 | bdcb0450055d |
hex | 5dcc998f0f7d |
103133331001213 has 16 divisors (see below), whose sum is σ = 106183639694080. Its totient is φ = 100134921309696.
The previous prime is 103133331001157. The next prime is 103133331001223. The reversal of 103133331001213 is 312100133331301.
It is a cyclic number.
It is not a de Polignac number, because 103133331001213 - 245 = 67948958912381 is a prime.
It is a super-2 number, since 2×1031333310012132 (a number of 29 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 (103133331001223) 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, 24589695 + ... + 28476652.
It is an arithmetic number, because the mean of its divisors is an integer number (6636477480880).
Almost surely, 2103133331001213 is an apocalyptic number.
It is an amenable number.
103133331001213 is a deficient number, since it is larger than the sum of its proper divisors (3050308692867).
103133331001213 is an equidigital number, since it uses as much as digits as its factorization.
103133331001213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53066836.
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 103133331001213 its reverse (312100133331301), we get a palindrome (415233464332514).
The spelling of 103133331001213 in words is "one hundred three trillion, one hundred thirty-three billion, three hundred thirty-one million, one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •