Base | Representation |
---|---|
bin | 101101100101010010010… |
… | …000111110111001100001 |
3 | 102002110022010120102000221 |
4 | 231211102100332321201 |
5 | 402310134300424213 |
6 | 10355002050043041 |
7 | 442211034045232 |
oct | 55452220767141 |
9 | 12073263512027 |
10 | 3132411342433 |
11 | aa84a25a509a |
12 | 4270ba279481 |
13 | 199501161c79 |
14 | ab876735089 |
15 | 5673411e38d |
hex | 2d95243ee61 |
3132411342433 has 6 divisors (see below), whose sum is σ = 3200476416866. Its totient is φ = 3065764290432.
The previous prime is 3132411342421. The next prime is 3132411342443. The reversal of 3132411342433 is 3342431142313.
3132411342433 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 2251989439569 + 880421902864 = 1500663^2 + 938308^2 .
It is not a de Polignac number, because 3132411342433 - 29 = 3132411341921 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3132411342443) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 709008960 + ... + 709013377.
Almost surely, 23132411342433 is an apocalyptic number.
It is an amenable number.
3132411342433 is a deficient number, since it is larger than the sum of its proper divisors (68065074433).
3132411342433 is an equidigital number, since it uses as much as digits as its factorization.
3132411342433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1418022431 (or 1418022384 counting only the distinct ones).
The product of its digits is 62208, while the sum is 34.
Adding to 3132411342433 its reverse (3342431142313), we get a palindrome (6474842484746).
The spelling of 3132411342433 in words is "three trillion, one hundred thirty-two billion, four hundred eleven million, three hundred forty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •