Base | Representation |
---|---|
bin | 111011101100011001011… |
… | …011000110011010010101 |
3 | 112112011021211001120001001 |
4 | 323230121123012122111 |
5 | 1014202120244132404 |
6 | 12420253230303301 |
7 | 602240236153555 |
oct | 73543133063225 |
9 | 15464254046031 |
10 | 4102120302229 |
11 | 1341776a72164 |
12 | 563027957b31 |
13 | 239a9c983b81 |
14 | 102787c13165 |
15 | 71a8b41c7a4 |
hex | 3bb196c6695 |
4102120302229 has 2 divisors, whose sum is σ = 4102120302230. Its totient is φ = 4102120302228.
The previous prime is 4102120302221. The next prime is 4102120302337. The reversal of 4102120302229 is 9222030212014.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3466708848100 + 635411454129 = 1861910^2 + 797127^2 .
It is a cyclic number.
It is not a de Polignac number, because 4102120302229 - 23 = 4102120302221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4102120302197 and 4102120302206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4102120302221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2051060151114 + 2051060151115.
It is an arithmetic number, because the mean of its divisors is an integer number (2051060151115).
Almost surely, 24102120302229 is an apocalyptic number.
It is an amenable number.
4102120302229 is a deficient number, since it is larger than the sum of its proper divisors (1).
4102120302229 is an equidigital number, since it uses as much as digits as its factorization.
4102120302229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 28.
The spelling of 4102120302229 in words is "four trillion, one hundred two billion, one hundred twenty million, three hundred two thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •