Base | Representation |
---|---|
bin | 10011111101010101111… |
… | …000001100100001010101 |
3 | 11212010011122202100222221 |
4 | 103331111320030201111 |
5 | 134432401023042013 |
6 | 2530024042422341 |
7 | 201042632136436 |
oct | 23752570144125 |
9 | 4763148670887 |
10 | 1371535362133 |
11 | 489734a57592 |
12 | 1a19905019b1 |
13 | 9c4486658a1 |
14 | 4a55006b48d |
15 | 25a2421808d |
hex | 13f55e0c855 |
1371535362133 has 8 divisors (see below), whose sum is σ = 1379232398880. Its totient is φ = 1363838712720.
The previous prime is 1371535362083. The next prime is 1371535362139. The reversal of 1371535362133 is 3312635351731.
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 1371535362133 - 29 = 1371535361621 is a prime.
It is a super-2 number, since 2×13715353621332 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1371535362133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1371535362139) 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, 9873943 + ... + 10011883.
It is an arithmetic number, because the mean of its divisors is an integer number (172404049860).
Almost surely, 21371535362133 is an apocalyptic number.
It is an amenable number.
1371535362133 is a deficient number, since it is larger than the sum of its proper divisors (7697036747).
1371535362133 is a wasteful number, since it uses less digits than its factorization.
1371535362133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 193667.
The product of its digits is 510300, while the sum is 43.
The spelling of 1371535362133 in words is "one trillion, three hundred seventy-one billion, five hundred thirty-five million, three hundred sixty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •