Base | Representation |
---|---|
bin | 10011100100111011011… |
… | …100010100010001010010 |
3 | 11202121111210202202110222 |
4 | 103210323130110101102 |
5 | 134020204420324300 |
6 | 2510011000153042 |
7 | 166124222453051 |
oct | 23447334242122 |
9 | 4677453682428 |
10 | 1345322042450 |
11 | 479603247521 |
12 | 198895768782 |
13 | 99b2b953339 |
14 | 491848c8398 |
15 | 24edcc78785 |
hex | 1393b714452 |
1345322042450 has 12 divisors (see below), whose sum is σ = 2502298999050. Its totient is φ = 538128816960.
The previous prime is 1345322042447. The next prime is 1345322042521. The reversal of 1345322042450 is 542402235431.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 490934244889 + 854387797561 = 700667^2 + 924331^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 1345322042450.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 13453220375 + ... + 13453220474.
Almost surely, 21345322042450 is an apocalyptic number.
1345322042450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1345322042450 is a deficient number, since it is larger than the sum of its proper divisors (1156976956600).
1345322042450 is a wasteful number, since it uses less digits than its factorization.
1345322042450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26906440861 (or 26906440856 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 35.
Adding to 1345322042450 its reverse (542402235431), we get a palindrome (1887724277881).
The spelling of 1345322042450 in words is "one trillion, three hundred forty-five billion, three hundred twenty-two million, forty-two thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •