Base | Representation |
---|---|
bin | 10001111110100100110… |
… | …010011100011110111001 |
3 | 11101002211120020211211101 |
4 | 101332210302130132321 |
5 | 130220120044114431 |
6 | 2343313320331401 |
7 | 155153603203300 |
oct | 21764462343671 |
9 | 4332746224741 |
10 | 1235420301241 |
11 | 436a36609725 |
12 | 17b523913b61 |
13 | 8c66590a539 |
14 | 43b1a7a1437 |
15 | 222095de961 |
hex | 11fa4c9c7b9 |
1235420301241 has 12 divisors (see below), whose sum is σ = 1440551483280. Its totient is φ = 1056404385960.
The previous prime is 1235420301209. The next prime is 1235420301359. The reversal of 1235420301241 is 1421030245321.
It is not a de Polignac number, because 1235420301241 - 25 = 1235420301209 is a prime.
It is a super-2 number, since 2×12354203012412 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1235420301041) 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 11 ways as a sum of consecutive naturals, for example, 30066175 + ... + 30107236.
It is an arithmetic number, because the mean of its divisors is an integer number (120045956940).
Almost surely, 21235420301241 is an apocalyptic number.
It is an amenable number.
1235420301241 is a deficient number, since it is larger than the sum of its proper divisors (205131182039).
1235420301241 is an equidigital number, since it uses as much as digits as its factorization.
1235420301241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60173844 (or 60173837 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 1235420301241 its reverse (1421030245321), we get a palindrome (2656450546562).
The spelling of 1235420301241 in words is "one trillion, two hundred thirty-five billion, four hundred twenty million, three hundred one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •