Base | Representation |
---|---|
bin | 111011101100011110001… |
… | …111110100111010000101 |
3 | 112112011111110100021020002 |
4 | 323230132033310322011 |
5 | 1014202302003424104 |
6 | 12420305241051045 |
7 | 602242241104454 |
oct | 73543617647205 |
9 | 15464443307202 |
10 | 4102201233029 |
11 | 1341808719719 |
12 | 56304aa86a85 |
13 | 239ab367bb13 |
14 | 10279487cb9b |
15 | 71a935a701e |
hex | 3bb1e3f4e85 |
4102201233029 has 2 divisors, whose sum is σ = 4102201233030. Its totient is φ = 4102201233028.
The previous prime is 4102201232971. The next prime is 4102201233037. The reversal of 4102201233029 is 9203321022014.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2714816428900 + 1387384804129 = 1647670^2 + 1177873^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4102201233029 is a prime.
It is a super-4 number, since 4×41022012330294 (a number of 52 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4102201232992 and 4102201233010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4102201233049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2051100616514 + 2051100616515.
It is an arithmetic number, because the mean of its divisors is an integer number (2051100616515).
Almost surely, 24102201233029 is an apocalyptic number.
It is an amenable number.
4102201233029 is a deficient number, since it is larger than the sum of its proper divisors (1).
4102201233029 is an equidigital number, since it uses as much as digits as its factorization.
4102201233029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 29.
The spelling of 4102201233029 in words is "four trillion, one hundred two billion, two hundred one million, two hundred thirty-three thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •