Base | Representation |
---|---|
bin | 1001011111010110111000… |
… | …0111111010111110010111 |
3 | 1100221111210220211101211211 |
4 | 2113311232013322332113 |
5 | 2331423443210213221 |
6 | 34105243433042251 |
7 | 2124566153143411 |
oct | 227655607727627 |
9 | 40844726741754 |
10 | 10434323132311 |
11 | 3363198427771 |
12 | 12062a9856387 |
13 | 5a8c4c6ba1c0 |
14 | 2810499659b1 |
15 | 131649c686e1 |
hex | 97d6e1faf97 |
10434323132311 has 4 divisors (see below), whose sum is σ = 11236963373272. Its totient is φ = 9631682891352.
The previous prime is 10434323132293. The next prime is 10434323132333. The reversal of 10434323132311 is 11323132343401.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10434323132311 - 27 = 10434323132183 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10434323132011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 401320120461 + ... + 401320120486.
It is an arithmetic number, because the mean of its divisors is an integer number (2809240843318).
Almost surely, 210434323132311 is an apocalyptic number.
10434323132311 is a deficient number, since it is larger than the sum of its proper divisors (802640240961).
10434323132311 is an equidigital number, since it uses as much as digits as its factorization.
10434323132311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 802640240960.
The product of its (nonzero) digits is 15552, while the sum is 31.
Adding to 10434323132311 its reverse (11323132343401), we get a palindrome (21757455475712).
The spelling of 10434323132311 in words is "ten trillion, four hundred thirty-four billion, three hundred twenty-three million, one hundred thirty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •