Base | Representation |
---|---|
bin | 10111111001101111… |
… | …10011101101001101 |
3 | 1020010022110121200001 |
4 | 23330313303231031 |
5 | 202240100011413 |
6 | 5521203204301 |
7 | 632666536114 |
oct | 137467635515 |
9 | 36108417601 |
10 | 12832422733 |
11 | 5495628149 |
12 | 25a1676691 |
13 | 129675a360 |
14 | 89a3c6c7b |
15 | 50189e4dd |
hex | 2fcdf3b4d |
12832422733 has 8 divisors (see below), whose sum is σ = 13825824768. Its totient is φ = 11839919664.
The previous prime is 12832422727. The next prime is 12832422803. The reversal of 12832422733 is 33722423821.
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 12832422733 - 29 = 12832422221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12832422692 and 12832422701.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12832422133) 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, 194941 + ... + 252322.
It is an arithmetic number, because the mean of its divisors is an integer number (1728228096).
Almost surely, 212832422733 is an apocalyptic number.
12832422733 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
12832422733 is a deficient number, since it is larger than the sum of its proper divisors (993402035).
12832422733 is a wasteful number, since it uses less digits than its factorization.
12832422733 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 449483.
The product of its digits is 96768, while the sum is 37.
The spelling of 12832422733 in words is "twelve billion, eight hundred thirty-two million, four hundred twenty-two thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •