Base | Representation |
---|---|
bin | 101110100100011011101… |
… | …000011010010111110011 |
3 | 102022221022102122011111020 |
4 | 232210123220122113303 |
5 | 404413014314323011 |
6 | 10450054052550523 |
7 | 450131201666064 |
oct | 56443350322763 |
9 | 12287272564436 |
10 | 3200214214131 |
11 | 1024226549150 |
12 | 438281322443 |
13 | 1a2a183420ac |
14 | b0c6961a56b |
15 | 583a18ce006 |
hex | 2e91ba1a5f3 |
3200214214131 has 8 divisors (see below), whose sum is σ = 4654857038784. Its totient is φ = 1939523766120.
The previous prime is 3200214214117. The next prime is 3200214214193. The reversal of 3200214214131 is 1314124120023.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3200214214131 - 219 = 3200213689843 is a prime.
It is a super-2 number, since 2×32002142141312 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (3200214214111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48488094121 + ... + 48488094186.
It is an arithmetic number, because the mean of its divisors is an integer number (581857129848).
Almost surely, 23200214214131 is an apocalyptic number.
3200214214131 is a deficient number, since it is larger than the sum of its proper divisors (1454642824653).
3200214214131 is a wasteful number, since it uses less digits than its factorization.
3200214214131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96976188321.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 3200214214131 its reverse (1314124120023), we get a palindrome (4514338334154).
The spelling of 3200214214131 in words is "three trillion, two hundred billion, two hundred fourteen million, two hundred fourteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.149 sec. • engine limits •