Base | Representation |
---|---|
bin | 10100100110001000111… |
… | …110001000101110100011 |
3 | 12000022020122002212001201 |
4 | 110212020332020232203 |
5 | 141142110102333220 |
6 | 3002111011542031 |
7 | 204153333313600 |
oct | 24461076105643 |
9 | 5008218085051 |
10 | 1415342230435 |
11 | 4a6274878081 |
12 | 1aa3772ba917 |
13 | a360a318833 |
14 | 4c7080776a7 |
15 | 26c3a025d0a |
hex | 14988f88ba3 |
1415342230435 has 12 divisors (see below), whose sum is σ = 1975702215888. Its totient is φ = 970520386416.
The previous prime is 1415342230433. The next prime is 1415342230507. The reversal of 1415342230435 is 5340322435141.
It is not a de Polignac number, because 1415342230435 - 21 = 1415342230433 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1415342230394 and 1415342230403.
It is not an unprimeable number, because it can be changed into a prime (1415342230433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2888453287 + ... + 2888453776.
It is an arithmetic number, because the mean of its divisors is an integer number (164641851324).
Almost surely, 21415342230435 is an apocalyptic number.
1415342230435 is a deficient number, since it is larger than the sum of its proper divisors (560359985453).
1415342230435 is an equidigital number, since it uses as much as digits as its factorization.
1415342230435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5776907082 (or 5776907075 counting only the distinct ones).
The product of its (nonzero) digits is 172800, while the sum is 37.
Adding to 1415342230435 its reverse (5340322435141), we get a palindrome (6755664665576).
The spelling of 1415342230435 in words is "one trillion, four hundred fifteen billion, three hundred forty-two million, two hundred thirty thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •