Base | Representation |
---|---|
bin | 101111000100000001010… |
… | …011101100100011010011 |
3 | 102110011212020112011220021 |
4 | 233010001103230203103 |
5 | 410442000333024243 |
6 | 10513423451324311 |
7 | 452441546043421 |
oct | 57040123544323 |
9 | 12404766464807 |
10 | 3234132314323 |
11 | 1037651417909 |
12 | 442968450697 |
13 | 1a5c92381871 |
14 | b276617a111 |
15 | 591d94a16ed |
hex | 2f1014ec8d3 |
3234132314323 has 8 divisors (see below), whose sum is σ = 3269639278080. Its totient is φ = 3198693700800.
The previous prime is 3234132314261. The next prime is 3234132314333.
It is a happy number.
3234132314323 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3234132314323 - 213 = 3234132306131 is a prime.
It is a super-2 number, since 2×32341323143232 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3234132314333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16992403 + ... + 17181676.
It is an arithmetic number, because the mean of its divisors is an integer number (408704909760).
Almost surely, 23234132314323 is an apocalyptic number.
3234132314323 is a deficient number, since it is larger than the sum of its proper divisors (35506963757).
3234132314323 is a wasteful number, since it uses less digits than its factorization.
3234132314323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34175117.
The product of its digits is 93312, while the sum is 34.
The spelling of 3234132314323 in words is "three trillion, two hundred thirty-four billion, one hundred thirty-two million, three hundred fourteen thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •