Base | Representation |
---|---|
bin | 11110010001000011001010… |
… | …010010010000101010010111 |
3 | 122110022110222020202201102220 |
4 | 132101003022102100222113 |
5 | 114421410431134101403 |
6 | 1151035135521033423 |
7 | 40016045506044345 |
oct | 3621031222205227 |
9 | 573273866681386 |
10 | 133113020222103 |
11 | 39460a07736639 |
12 | 12b1a241185873 |
13 | 5937672226a4c |
14 | 24c29c1426995 |
15 | 105c896120953 |
hex | 7910ca490a97 |
133113020222103 has 8 divisors (see below), whose sum is σ = 177484655762688. Its totient is φ = 88741699081464.
The previous prime is 133113020222089. The next prime is 133113020222113. The reversal of 133113020222103 is 301222020311331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 133113020222103 - 221 = 133113018124951 is a prime.
It is a super-2 number, since 2×1331130202221032 (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 (133113020222113) 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, 77610301 + ... + 79306902.
It is an arithmetic number, because the mean of its divisors is an integer number (22185581970336).
Almost surely, 2133113020222103 is an apocalyptic number.
133113020222103 is a deficient number, since it is larger than the sum of its proper divisors (44371635540585).
133113020222103 is a wasteful number, since it uses less digits than its factorization.
133113020222103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 157199973.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 133113020222103 its reverse (301222020311331), we get a palindrome (434335040533434).
The spelling of 133113020222103 in words is "one hundred thirty-three trillion, one hundred thirteen billion, twenty million, two hundred twenty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •