Base | Representation |
---|---|
bin | 10010101101001100101111… |
… | …11110111110100001011111 |
3 | 12101122111210100112211100201 |
4 | 21112212113332332201133 |
5 | 20342430401111144211 |
6 | 223253210550004331 |
7 | 11443636560656500 |
oct | 1126462776764137 |
9 | 171574710484321 |
10 | 41135451662431 |
11 | 1211a4a1078835 |
12 | 47443ab6466a7 |
13 | 19c5097025c89 |
14 | a22d76060ba7 |
15 | 4b5062c190c1 |
hex | 256997fbe85f |
41135451662431 has 6 divisors (see below), whose sum is σ = 47851443770640. Its totient is φ = 35258958567756.
The previous prime is 41135451662429. The next prime is 41135451662449. The reversal of 41135451662431 is 13426615453114.
It is not a de Polignac number, because 41135451662431 - 21 = 41135451662429 is a prime.
It is a super-2 number, since 2×411354516624312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41135451668431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 419749506711 + ... + 419749506808.
It is an arithmetic number, because the mean of its divisors is an integer number (7975240628440).
Almost surely, 241135451662431 is an apocalyptic number.
41135451662431 is a deficient number, since it is larger than the sum of its proper divisors (6715992108209).
41135451662431 is an equidigital number, since it uses as much as digits as its factorization.
41135451662431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 839499013533 (or 839499013526 counting only the distinct ones).
The product of its digits is 1036800, while the sum is 46.
The spelling of 41135451662431 in words is "forty-one trillion, one hundred thirty-five billion, four hundred fifty-one million, six hundred sixty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •