Base | Representation |
---|---|
bin | 10001111110100100110… |
… | …111001110101010001101 |
3 | 11101002211122121120010112 |
4 | 101332210313032222031 |
5 | 130220120404232331 |
6 | 2343313403245405 |
7 | 155153616645461 |
oct | 21764467165215 |
9 | 4332748546115 |
10 | 1235421555341 |
11 | 436a37295976 |
12 | 17b524219865 |
13 | 8c665c592cc |
14 | 43b1aa0a4a1 |
15 | 2220978b32b |
hex | 11fa4dcea8d |
1235421555341 has 4 divisors (see below), whose sum is σ = 1289135536032. Its totient is φ = 1181707574652.
The previous prime is 1235421555317. The next prime is 1235421555367. The reversal of 1235421555341 is 1435551245321.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1235421555341 - 226 = 1235354446477 is a prime.
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 (1235421555311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26856990311 + ... + 26856990356.
It is an arithmetic number, because the mean of its divisors is an integer number (322283884008).
Almost surely, 21235421555341 is an apocalyptic number.
It is an amenable number.
1235421555341 is a deficient number, since it is larger than the sum of its proper divisors (53713980691).
1235421555341 is an equidigital number, since it uses as much as digits as its factorization.
1235421555341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53713980690.
The product of its digits is 360000, while the sum is 41.
The spelling of 1235421555341 in words is "one trillion, two hundred thirty-five billion, four hundred twenty-one million, five hundred fifty-five thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •