Base | Representation |
---|---|
bin | 101110101110110001100… |
… | …110000111111000111100 |
3 | 102100222222102101012112112 |
4 | 232232301212013320330 |
5 | 410103240423144012 |
6 | 10455132103153152 |
7 | 451003335506621 |
oct | 56566146077074 |
9 | 12328872335475 |
10 | 3211320131132 |
11 | 1028a05549a53 |
12 | 43a4607457b8 |
13 | 1a3a981a2509 |
14 | b16005bc348 |
15 | 588018e1122 |
hex | 2ebb1987e3c |
3211320131132 has 48 divisors (see below), whose sum is σ = 5834487859200. Its totient is φ = 1544923886400.
The previous prime is 3211320131113. The next prime is 3211320131143. The reversal of 3211320131132 is 2311310231123.
It is a super-3 number, since 3×32113201311323 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 3211320131098 and 3211320131107.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 115505369 + ... + 115533167.
It is an arithmetic number, because the mean of its divisors is an integer number (121551830400).
Almost surely, 23211320131132 is an apocalyptic number.
It is an amenable number.
3211320131132 is a deficient number, since it is larger than the sum of its proper divisors (2623167728068).
3211320131132 is a wasteful number, since it uses less digits than its factorization.
3211320131132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33162 (or 33160 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 3211320131132 its reverse (2311310231123), we get a palindrome (5522630362255).
Subtracting from 3211320131132 its reverse (2311310231123), we obtain a palindrome (900009900009).
The spelling of 3211320131132 in words is "three trillion, two hundred eleven billion, three hundred twenty million, one hundred thirty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •