Base | Representation |
---|---|
bin | 1100110110010101… |
… | …0110111010000001 |
3 | 22220101010120111022 |
4 | 3031211112322001 |
5 | 24030433404213 |
6 | 1330130355225 |
7 | 151321025351 |
oct | 31545267201 |
9 | 8811116438 |
10 | 3449122433 |
11 | 150aa37809 |
12 | 80312bb15 |
13 | 42c764963 |
14 | 24a116b61 |
15 | 152c0c308 |
hex | cd956e81 |
3449122433 has 2 divisors, whose sum is σ = 3449122434. Its totient is φ = 3449122432.
The previous prime is 3449122399. The next prime is 3449122441. The reversal of 3449122433 is 3342219443.
3449122433 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2951966224 + 497156209 = 54332^2 + 22297^2 .
It is a cyclic number.
It is not a de Polignac number, because 3449122433 - 222 = 3444928129 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 3449122393 and 3449122402.
It is not a weakly prime, because it can be changed into another prime (3449122463) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1724561216 + 1724561217.
It is an arithmetic number, because the mean of its divisors is an integer number (1724561217).
Almost surely, 23449122433 is an apocalyptic number.
It is an amenable number.
3449122433 is a deficient number, since it is larger than the sum of its proper divisors (1).
3449122433 is an equidigital number, since it uses as much as digits as its factorization.
3449122433 is an evil number, because the sum of its binary digits is even.
The product of its digits is 62208, while the sum is 35.
The square root of 3449122433 is about 58729.2298008411. The cubic root of 3449122433 is about 1510.9016781823.
The spelling of 3449122433 in words is "three billion, four hundred forty-nine million, one hundred twenty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •