Base | Representation |
---|---|
bin | 110110111001001101110001… |
… | …001011100010011010110111 |
3 | 1011122211010111100001000101102 |
4 | 312321031301023202122313 |
5 | 223121012033203303211 |
6 | 2213245414051120315 |
7 | 101565321625325345 |
oct | 6671156113423267 |
9 | 1148733440030342 |
10 | 241426305525431 |
11 | 6aa20359553274 |
12 | 230b20512a309b |
13 | a4935312b7970 |
14 | 438914a210995 |
15 | 1cda0bb520a3b |
hex | db93712e26b7 |
241426305525431 has 4 divisors (see below), whose sum is σ = 259997559796632. Its totient is φ = 222855051254232.
The previous prime is 241426305525371. The next prime is 241426305525533. The reversal of 241426305525431 is 134525503624142.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 241426305525431 - 214 = 241426305509047 is a prime.
It is a super-2 number, since 2×2414263055254312 (a number of 30 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 (241426305528431) 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, 9285627135581 + ... + 9285627135606.
It is an arithmetic number, because the mean of its divisors is an integer number (64999389949158).
Almost surely, 2241426305525431 is an apocalyptic number.
241426305525431 is a deficient number, since it is larger than the sum of its proper divisors (18571254271201).
241426305525431 is a wasteful number, since it uses less digits than its factorization.
241426305525431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18571254271200.
The product of its (nonzero) digits is 3456000, while the sum is 47.
The spelling of 241426305525431 in words is "two hundred forty-one trillion, four hundred twenty-six billion, three hundred five million, five hundred twenty-five thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •