Base | Representation |
---|---|
bin | 100110111111101000… |
… | …000000101001110101 |
3 | 11000001222010012122201 |
4 | 212333220000221311 |
5 | 1141222112023412 |
6 | 31122403424501 |
7 | 3011366042104 |
oct | 467750005165 |
9 | 130058105581 |
10 | 41869642357 |
11 | 1683635a014 |
12 | 8146085131 |
13 | 3c4351740a |
14 | 2052a1203b |
15 | 1150be9e57 |
hex | 9bfa00a75 |
41869642357 has 2 divisors, whose sum is σ = 41869642358. Its totient is φ = 41869642356.
The previous prime is 41869642271. The next prime is 41869642369. The reversal of 41869642357 is 75324696814.
41869642357 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., 33109805521 + 8759836836 = 181961^2 + 93594^2 .
It is a cyclic number.
It is not a de Polignac number, because 41869642357 - 219 = 41869118069 is a prime.
It is a super-2 number, since 2×418696423572 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 41869642298 and 41869642307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41869642457) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20934821178 + 20934821179.
It is an arithmetic number, because the mean of its divisors is an integer number (20934821179).
Almost surely, 241869642357 is an apocalyptic number.
It is an amenable number.
41869642357 is a deficient number, since it is larger than the sum of its proper divisors (1).
41869642357 is an equidigital number, since it uses as much as digits as its factorization.
41869642357 is an evil number, because the sum of its binary digits is even.
The product of its digits is 8709120, while the sum is 55.
The spelling of 41869642357 in words is "forty-one billion, eight hundred sixty-nine million, six hundred forty-two thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •