Base | Representation |
---|---|
bin | 1100000011001011000… |
… | …01000111100101001001 |
3 | 1110120122202202020200211 |
4 | 12001211201013211021 |
5 | 23240403112303113 |
6 | 514110450201121 |
7 | 41624542166134 |
oct | 6014541074511 |
9 | 1416582666624 |
10 | 414020041033 |
11 | 14a648579775 |
12 | 682a65831a1 |
13 | 30071146201 |
14 | 160781b521b |
15 | ab82689b3d |
hex | 6065847949 |
414020041033 has 4 divisors (see below), whose sum is σ = 414224094340. Its totient is φ = 413815987728.
The previous prime is 414020041009. The next prime is 414020041067. The reversal of 414020041033 is 330140020414.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 273640933449 + 140379107584 = 523107^2 + 374672^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-414020041033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 414020040995 and 414020041013.
It is not an unprimeable number, because it can be changed into a prime (414020041093) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 102023610 + ... + 102027667.
It is an arithmetic number, because the mean of its divisors is an integer number (103556023585).
Almost surely, 2414020041033 is an apocalyptic number.
It is an amenable number.
414020041033 is a deficient number, since it is larger than the sum of its proper divisors (204053307).
414020041033 is a wasteful number, since it uses less digits than its factorization.
414020041033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 204053306.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 414020041033 its reverse (330140020414), we get a palindrome (744160061447).
The spelling of 414020041033 in words is "four hundred fourteen billion, twenty million, forty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •