Base | Representation |
---|---|
bin | 111011101101011011000… |
… | …011000101110000100001 |
3 | 112112021010112210021000111 |
4 | 323231123003011300201 |
5 | 1014211344123214403 |
6 | 12420554400451321 |
7 | 602306435422363 |
oct | 73553303056041 |
9 | 15467115707014 |
10 | 4103221304353 |
11 | 1342191501376 |
12 | 563294619b41 |
13 | 239c16ac5a12 |
14 | 102850132d33 |
15 | 71b02e0056d |
hex | 3bb5b0c5c21 |
4103221304353 has 2 divisors, whose sum is σ = 4103221304354. Its totient is φ = 4103221304352.
The previous prime is 4103221304341. The next prime is 4103221304443. The reversal of 4103221304353 is 3534031223014.
It is a happy number.
4103221304353 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3904761746209 + 198459558144 = 1976047^2 + 445488^2 .
It is a cyclic number.
It is not a de Polignac number, because 4103221304353 - 233 = 4094631369761 is a prime.
It is not a weakly prime, because it can be changed into another prime (4103251304353) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2051610652176 + 2051610652177.
It is an arithmetic number, because the mean of its divisors is an integer number (2051610652177).
Almost surely, 24103221304353 is an apocalyptic number.
It is an amenable number.
4103221304353 is a deficient number, since it is larger than the sum of its proper divisors (1).
4103221304353 is an equidigital number, since it uses as much as digits as its factorization.
4103221304353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 31.
Adding to 4103221304353 its reverse (3534031223014), we get a palindrome (7637252527367).
The spelling of 4103221304353 in words is "four trillion, one hundred three billion, two hundred twenty-one million, three hundred four thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •