Base | Representation |
---|---|
bin | 1111100001010101111110… |
… | …11001010010011100101001 |
3 | 11110211220010112220121202202 |
4 | 13300222333121102130221 |
5 | 13433200312412231213 |
6 | 200331324044305545 |
7 | 10121612344333436 |
oct | 760527731223451 |
9 | 143756115817682 |
10 | 34131021211433 |
11 | a969980753043 |
12 | 39b29a1b422b5 |
13 | 1607706865313 |
14 | 85dd43664b8d |
15 | 3e2c5d5b8b58 |
hex | 1f0abf652729 |
34131021211433 has 2 divisors, whose sum is σ = 34131021211434. Its totient is φ = 34131021211432.
The previous prime is 34131021211369. The next prime is 34131021211453. The reversal of 34131021211433 is 33411212013143.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 34021415852944 + 109605358489 = 5832788^2 + 331067^2 .
It is a cyclic number.
It is not a de Polignac number, because 34131021211433 - 26 = 34131021211369 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 34131021211396 and 34131021211405.
It is not a weakly prime, because it can be changed into another prime (34131021211453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 17065510605716 + 17065510605717.
It is an arithmetic number, because the mean of its divisors is an integer number (17065510605717).
Almost surely, 234131021211433 is an apocalyptic number.
It is an amenable number.
34131021211433 is a deficient number, since it is larger than the sum of its proper divisors (1).
34131021211433 is an equidigital number, since it uses as much as digits as its factorization.
34131021211433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 34131021211433 its reverse (33411212013143), we get a palindrome (67542233224576).
The spelling of 34131021211433 in words is "thirty-four trillion, one hundred thirty-one billion, twenty-one million, two hundred eleven thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •