Base | Representation |
---|---|
bin | 110001000111100100111101… |
… | …1100011011100101111000101 |
3 | 2002122202120121021012121211122 |
4 | 1202033021323203130233011 |
5 | 423112201411321023013 |
6 | 4130521011432443325 |
7 | 160001404043013332 |
oct | 14217117343345705 |
9 | 2078676537177748 |
10 | 432050013064133 |
11 | 115734421943892 |
12 | 4055a22b249545 |
13 | 157101ab8b6529 |
14 | 7899491815989 |
15 | 34e392b9aaa08 |
hex | 188f27b8dcbc5 |
432050013064133 has 8 divisors (see below), whose sum is σ = 436261420603008. Its totient is φ = 427838927587344.
The previous prime is 432050013064073. The next prime is 432050013064151. The reversal of 432050013064133 is 331460310050234.
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 432050013064133 - 214 = 432050013047749 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 432050013064093 and 432050013064102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (432050013064633) 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, 77818985 + ... + 83185902.
It is an arithmetic number, because the mean of its divisors is an integer number (54532677575376).
Almost surely, 2432050013064133 is an apocalyptic number.
It is an amenable number.
432050013064133 is a deficient number, since it is larger than the sum of its proper divisors (4211407538875).
432050013064133 is a wasteful number, since it uses less digits than its factorization.
432050013064133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161031043.
The product of its (nonzero) digits is 77760, while the sum is 35.
The spelling of 432050013064133 in words is "four hundred thirty-two trillion, fifty billion, thirteen million, sixty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •