Base | Representation |
---|---|
bin | 10011000100001111111… |
… | …111100000100110100101 |
3 | 11122020221102011120212101 |
4 | 103010033333200212211 |
5 | 132431324213112013 |
6 | 2441525103252101 |
7 | 163442542365055 |
oct | 23041777404645 |
9 | 4566842146771 |
10 | 1310233332133 |
11 | 465737616080 |
12 | 191b225aa031 |
13 | 9672923c75b |
14 | 475b66c9565 |
15 | 241375238dd |
hex | 1310ffe09a5 |
1310233332133 has 64 divisors (see below), whose sum is σ = 1573058174976. Its totient is φ = 1077777792000.
The previous prime is 1310233332127. The next prime is 1310233332143. The reversal of 1310233332133 is 3312333320131.
It is a cyclic number.
It is not a de Polignac number, because 1310233332133 - 29 = 1310233331621 is a prime.
It is a super-3 number, since 3×13102333321333 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1310233332113) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 627806016 + ... + 627808102.
It is an arithmetic number, because the mean of its divisors is an integer number (24579033984).
Almost surely, 21310233332133 is an apocalyptic number.
It is an amenable number.
1310233332133 is a deficient number, since it is larger than the sum of its proper divisors (262824842843).
1310233332133 is a wasteful number, since it uses less digits than its factorization.
1310233332133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3394.
The product of its (nonzero) digits is 8748, while the sum is 28.
Adding to 1310233332133 its reverse (3312333320131), we get a palindrome (4622566652264).
The spelling of 1310233332133 in words is "one trillion, three hundred ten billion, two hundred thirty-three million, three hundred thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •