Base | Representation |
---|---|
bin | 100101010110100010100… |
… | …1011111010010111100011 |
3 | 200011202211122220100212022 |
4 | 1022231011023322113203 |
5 | 1133102202021404113 |
6 | 14530210440252055 |
7 | 1036615356464306 |
oct | 112550513722743 |
9 | 20152748810768 |
10 | 5133646669283 |
11 | 16aa192790260 |
12 | 6aab27a7102b |
13 | 2b3140609272 |
14 | 13a6812acb3d |
15 | 8d8107b4908 |
hex | 4ab452fa5e3 |
5133646669283 has 8 divisors (see below), whose sum is σ = 5706008648496. Its totient is φ = 4578895828000.
The previous prime is 5133646669273. The next prime is 5133646669429. The reversal of 5133646669283 is 3829666463315.
It is a happy number.
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 5133646669283 - 24 = 5133646669267 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5133646669213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4402783868 + ... + 4402785033.
It is an arithmetic number, because the mean of its divisors is an integer number (713251081062).
Almost surely, 25133646669283 is an apocalyptic number.
5133646669283 is a gapful number since it is divisible by the number (53) formed by its first and last digit.
5133646669283 is a deficient number, since it is larger than the sum of its proper divisors (572361979213).
5133646669283 is a wasteful number, since it uses less digits than its factorization.
5133646669283 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8805568965.
The product of its digits is 100776960, while the sum is 62.
The spelling of 5133646669283 in words is "five trillion, one hundred thirty-three billion, six hundred forty-six million, six hundred sixty-nine thousand, two hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •