Base | Representation |
---|---|
bin | 1110100110010001010101… |
… | …00110001001010110001011 |
3 | 11012122212001210202121210210 |
4 | 13103020222212021112023 |
5 | 13201421430323310011 |
6 | 152135044515212203 |
7 | 6522146100451512 |
oct | 723105246112613 |
9 | 135585053677723 |
10 | 32101300213131 |
11 | a2570a3100346 |
12 | 37255445a7063 |
13 | 14bb1a7994026 |
14 | 7cd9d5835679 |
15 | 3aa0662246a6 |
hex | 1d322a98958b |
32101300213131 has 64 divisors (see below), whose sum is σ = 46640237764608. Its totient is φ = 19557261416448.
The previous prime is 32101300213061. The next prime is 32101300213219. The reversal of 32101300213131 is 13131200310123.
It is a happy number.
It is not a de Polignac number, because 32101300213131 - 214 = 32101300196747 is a prime.
It is a super-2 number, since 2×321013002131312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 32101300213098 and 32101300213107.
It is not an unprimeable number, because it can be changed into a prime (32101300213831) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3966547321 + ... + 3966555413.
It is an arithmetic number, because the mean of its divisors is an integer number (728753715072).
Almost surely, 232101300213131 is an apocalyptic number.
32101300213131 is a deficient number, since it is larger than the sum of its proper divisors (14538937551477).
32101300213131 is a wasteful number, since it uses less digits than its factorization.
32101300213131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12220.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 32101300213131 its reverse (13131200310123), we get a palindrome (45232500523254).
The spelling of 32101300213131 in words is "thirty-two trillion, one hundred one billion, three hundred million, two hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •