Base | Representation |
---|---|
bin | 110001110100111100011… |
… | …001111010100001111101 |
3 | 110010100012120200110022212 |
4 | 301310330121322201331 |
5 | 422100030201024323 |
6 | 11141002204550205 |
7 | 502245306563552 |
oct | 61647431724175 |
9 | 13110176613285 |
10 | 3424102361213 |
11 | 1100176575866 |
12 | 473744b52365 |
13 | 1bab78726a31 |
14 | bba2813ca29 |
15 | 5e1070ecb78 |
hex | 31d3c67a87d |
3424102361213 has 2 divisors, whose sum is σ = 3424102361214. Its totient is φ = 3424102361212.
The previous prime is 3424102361209. The next prime is 3424102361227. The reversal of 3424102361213 is 3121632014243.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3081664388089 + 342437973124 = 1755467^2 + 585182^2 .
It is a cyclic number.
It is not a de Polignac number, because 3424102361213 - 22 = 3424102361209 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3424102361213.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3424102361233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1712051180606 + 1712051180607.
It is an arithmetic number, because the mean of its divisors is an integer number (1712051180607).
Almost surely, 23424102361213 is an apocalyptic number.
It is an amenable number.
3424102361213 is a deficient number, since it is larger than the sum of its proper divisors (1).
3424102361213 is an equidigital number, since it uses as much as digits as its factorization.
3424102361213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20736, while the sum is 32.
Adding to 3424102361213 its reverse (3121632014243), we get a palindrome (6545734375456).
The spelling of 3424102361213 in words is "three trillion, four hundred twenty-four billion, one hundred two million, three hundred sixty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •