Base | Representation |
---|---|
bin | 1100100110111001101… |
… | …10100011111010101101 |
3 | 1112102011121000202001202 |
4 | 12103130312203322231 |
5 | 24044144204120023 |
6 | 531002114415245 |
7 | 43204102262120 |
oct | 6233466437255 |
9 | 1472147022052 |
10 | 433202020013 |
11 | 1577a1279464 |
12 | 6bb5a591525 |
13 | 31b0a1cb529 |
14 | 16d779a03b7 |
15 | b4066be128 |
hex | 64dcda3ead |
433202020013 has 8 divisors (see below), whose sum is σ = 495111908928. Its totient is φ = 371298102624.
The previous prime is 433202020001. The next prime is 433202020063. The reversal of 433202020013 is 310020202334.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-433202020013 is a prime.
It is a super-3 number, since 3×4332020200133 (a number of 36 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (433202020063) 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, 1336331 + ... + 1628552.
It is an arithmetic number, because the mean of its divisors is an integer number (61888988616).
Almost surely, 2433202020013 is an apocalyptic number.
It is an amenable number.
433202020013 is a deficient number, since it is larger than the sum of its proper divisors (61909888915).
433202020013 is a wasteful number, since it uses less digits than its factorization.
433202020013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2985763.
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 433202020013 its reverse (310020202334), we get a palindrome (743222222347).
The spelling of 433202020013 in words is "four hundred thirty-three billion, two hundred two million, twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •