Base | Representation |
---|---|
bin | 111010101001010111001… |
… | …000000001111101100101 |
3 | 112021021111110101111220111 |
4 | 322221113020001331211 |
5 | 1012012212101443004 |
6 | 12323230553133021 |
7 | 564111436451455 |
oct | 72512710017545 |
9 | 15237443344814 |
10 | 4030141046629 |
11 | 131419a612065 |
12 | 55109a0ba171 |
13 | 23306b476379 |
14 | dd0ba3c1d65 |
15 | 6ec77195a04 |
hex | 3aa57201f65 |
4030141046629 has 2 divisors, whose sum is σ = 4030141046630. Its totient is φ = 4030141046628.
The previous prime is 4030141046531. The next prime is 4030141046639. The reversal of 4030141046629 is 9266401410304.
4030141046629 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., 3966749388900 + 63391657729 = 1991670^2 + 251777^2 .
It is a cyclic number.
It is not a de Polignac number, because 4030141046629 - 29 = 4030141046117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4030141046591 and 4030141046600.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4030141046639) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2015070523314 + 2015070523315.
It is an arithmetic number, because the mean of its divisors is an integer number (2015070523315).
Almost surely, 24030141046629 is an apocalyptic number.
It is an amenable number.
4030141046629 is a deficient number, since it is larger than the sum of its proper divisors (1).
4030141046629 is an equidigital number, since it uses as much as digits as its factorization.
4030141046629 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 124416, while the sum is 40.
The spelling of 4030141046629 in words is "four trillion, thirty billion, one hundred forty-one million, forty-six thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •