Base | Representation |
---|---|
bin | 101110101110100110010… |
… | …101111010010110111110 |
3 | 102100222111021010012212012 |
4 | 232232212111322112332 |
5 | 410102344110111110 |
6 | 10455101240411222 |
7 | 450665553653126 |
oct | 56564625722676 |
9 | 12328437105765 |
10 | 3211131332030 |
11 | 1028918a17436 |
12 | 43a409476b12 |
13 | 1a3a6803a57b |
14 | b15c34b3c86 |
15 | 587e004a905 |
hex | 2eba657a5be |
3211131332030 has 8 divisors (see below), whose sum is σ = 5780036397672. Its totient is φ = 1284452532808.
The previous prime is 3211131331931. The next prime is 3211131332033. The reversal of 3211131332030 is 302331311123.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×32111313320303 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 3211131331987 and 3211131332005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3211131332033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 160556566592 + ... + 160556566611.
It is an arithmetic number, because the mean of its divisors is an integer number (722504549709).
Almost surely, 23211131332030 is an apocalyptic number.
3211131332030 is a deficient number, since it is larger than the sum of its proper divisors (2568905065642).
3211131332030 is a wasteful number, since it uses less digits than its factorization.
3211131332030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 321113133210.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 3211131332030 its reverse (302331311123), we get a palindrome (3513462643153).
The spelling of 3211131332030 in words is "three trillion, two hundred eleven billion, one hundred thirty-one million, three hundred thirty-two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •