Base | Representation |
---|---|
bin | 1110100110001111010100… |
… | …00000100111000010000111 |
3 | 11012122202021021210222011020 |
4 | 13103013222000213002013 |
5 | 13201412220424201211 |
6 | 152134345210242223 |
7 | 6522110202246264 |
oct | 723075200470207 |
9 | 135582237728136 |
10 | 32100216631431 |
11 | a25669748a383 |
12 | 37252a1726373 |
13 | 14bb064341420 |
14 | 7cd93196c26b |
15 | 3aa001033306 |
hex | 1d31ea027087 |
32100216631431 has 16 divisors (see below), whose sum is σ = 48803949268704. Its totient is φ = 18591980673024.
The previous prime is 32100216631393. The next prime is 32100216631481. The reversal of 32100216631431 is 13413661200123.
It is not a de Polignac number, because 32100216631431 - 26 = 32100216631367 is a prime.
It is a super-2 number, since 2×321002166314312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 32100216631392 and 32100216631401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32100216631481) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24208307506 + ... + 24208308831.
It is an arithmetic number, because the mean of its divisors is an integer number (3050246829294).
Almost surely, 232100216631431 is an apocalyptic number.
32100216631431 is a deficient number, since it is larger than the sum of its proper divisors (16703732637273).
32100216631431 is a wasteful number, since it uses less digits than its factorization.
32100216631431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48416616370.
The product of its (nonzero) digits is 15552, while the sum is 33.
Adding to 32100216631431 its reverse (13413661200123), we get a palindrome (45513877831554).
The spelling of 32100216631431 in words is "thirty-two trillion, one hundred billion, two hundred sixteen million, six hundred thirty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.333 sec. • engine limits •