Base | Representation |
---|---|
bin | 110110111001110100101100… |
… | …100001010000000010011001 |
3 | 1011122222010101021212001100011 |
4 | 312321310230201100002121 |
5 | 223122203133413343421 |
6 | 2213320525405441521 |
7 | 101601331462246603 |
oct | 6671645441200231 |
9 | 1148863337761304 |
10 | 241468103262361 |
11 | 6aa3705825a708 |
12 | 230ba1772702a1 |
13 | a497462947191 |
14 | 438b193466173 |
15 | 1cdb215c654e1 |
hex | db9d2c850099 |
241468103262361 has 8 divisors (see below), whose sum is σ = 241540222275648. Its totient is φ = 241395985614000.
The previous prime is 241468103262329. The next prime is 241468103262457. The reversal of 241468103262361 is 163262301864142.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 241468103262361 - 25 = 241468103262329 is a prime.
It is a super-2 number, since 2×2414681032623612 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (241468103262311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 436539876 + ... + 437092666.
It is an arithmetic number, because the mean of its divisors is an integer number (30192527784456).
Almost surely, 2241468103262361 is an apocalyptic number.
It is an amenable number.
241468103262361 is a deficient number, since it is larger than the sum of its proper divisors (72119013287).
241468103262361 is a wasteful number, since it uses less digits than its factorization.
241468103262361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 682463.
The product of its (nonzero) digits is 1990656, while the sum is 49.
The spelling of 241468103262361 in words is "two hundred forty-one trillion, four hundred sixty-eight billion, one hundred three million, two hundred sixty-two thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •