Base | Representation |
---|---|
bin | 1110100110001111001001… |
… | …11010111101101011010000 |
3 | 11012122202001100011220202011 |
4 | 13103013210322331223100 |
5 | 13201412032100441412 |
6 | 152134332520432304 |
7 | 6522105114533242 |
oct | 723074472755320 |
9 | 135582040156664 |
10 | 32100131265232 |
11 | a2566532834a8 |
12 | 3725279018694 |
13 | 14bb04c752694 |
14 | 7cd9244aa092 |
15 | 3a9ee87be7a7 |
hex | 1d31e4ebdad0 |
32100131265232 has 40 divisors (see below), whose sum is σ = 62426365171200. Its totient is φ = 15990116092032.
The previous prime is 32100131265179. The next prime is 32100131265239. The reversal of 32100131265232 is 23256213100123.
It is a super-2 number, since 2×321001312652322 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 32100131265194 and 32100131265203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32100131265239) 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, 35178369 + ... + 36079327.
It is an arithmetic number, because the mean of its divisors is an integer number (1560659129280).
Almost surely, 232100131265232 is an apocalyptic number.
It is an amenable number.
32100131265232 is a deficient number, since it is larger than the sum of its proper divisors (30326233905968).
32100131265232 is a wasteful number, since it uses less digits than its factorization.
32100131265232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 909283 (or 909277 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 32100131265232 its reverse (23256213100123), we get a palindrome (55356344365355).
The spelling of 32100131265232 in words is "thirty-two trillion, one hundred billion, one hundred thirty-one million, two hundred sixty-five thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •