Base | Representation |
---|---|
bin | 10010000011111111111… |
… | …010111001010011101101 |
3 | 11101122212102222002022002 |
4 | 102003333322321103231 |
5 | 130314032004213123 |
6 | 2350115243102045 |
7 | 155451121464314 |
oct | 22037772712355 |
9 | 4348772862262 |
10 | 1241244210413 |
11 | 439454aa78a9 |
12 | 18068a211925 |
13 | 9008337083c |
14 | 4411005327b |
15 | 2244aa42528 |
hex | 120ffeb94ed |
1241244210413 has 8 divisors (see below), whose sum is σ = 1290131266080. Its totient is φ = 1192762856880.
The previous prime is 1241244210383. The next prime is 1241244210419. The reversal of 1241244210413 is 3140124421421.
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 1241244210413 - 228 = 1240975774957 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1241244210419) 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, 101419295 + ... + 101431532.
It is an arithmetic number, because the mean of its divisors is an integer number (161266408260).
Almost surely, 21241244210413 is an apocalyptic number.
It is an amenable number.
1241244210413 is a deficient number, since it is larger than the sum of its proper divisors (48887055667).
1241244210413 is a wasteful number, since it uses less digits than its factorization.
1241244210413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202851067.
The product of its (nonzero) digits is 6144, while the sum is 29.
Adding to 1241244210413 its reverse (3140124421421), we get a palindrome (4381368631834).
The spelling of 1241244210413 in words is "one trillion, two hundred forty-one billion, two hundred forty-four million, two hundred ten thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •