Base | Representation |
---|---|
bin | 1110100111000011111011… |
… | …00110000110001101100001 |
3 | 11012202110011210102102101210 |
4 | 13103201331212012031201 |
5 | 13202343042400403433 |
6 | 152155340101420333 |
7 | 6524130152263230 |
oct | 723417546061541 |
9 | 135673153372353 |
10 | 32128462512993 |
11 | a267671557250 |
12 | 372a86510a6a9 |
13 | 14c091618c102 |
14 | 7d1051044b17 |
15 | 3aab05b68463 |
hex | 1d387d986361 |
32128462512993 has 16 divisors (see below), whose sum is σ = 53408353268736. Its totient is φ = 16690110396240.
The previous prime is 32128462512953. The next prime is 32128462513067. The reversal of 32128462512993 is 39921526482123.
It is not a de Polignac number, because 32128462512993 - 26 = 32128462512929 is a prime.
It is not an unprimeable number, because it can be changed into a prime (32128462512953) 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 15 ways as a sum of consecutive naturals, for example, 69542126421 + ... + 69542126882.
It is an arithmetic number, because the mean of its divisors is an integer number (3338022079296).
Almost surely, 232128462512993 is an apocalyptic number.
32128462512993 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
32128462512993 is a deficient number, since it is larger than the sum of its proper divisors (21279890755743).
32128462512993 is a wasteful number, since it uses less digits than its factorization.
32128462512993 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139084253324.
The product of its digits is 11197440, while the sum is 57.
The spelling of 32128462512993 in words is "thirty-two trillion, one hundred twenty-eight billion, four hundred sixty-two million, five hundred twelve thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •