Base | Representation |
---|---|
bin | 10010000111110010100… |
… | …010000001010011001011 |
3 | 11102001101010000220200112 |
4 | 102013302202001103023 |
5 | 130400401011144120 |
6 | 2352031204424535 |
7 | 155654025022400 |
oct | 22076242012313 |
9 | 4361333026615 |
10 | 1245314553035 |
11 | 440153666523 |
12 | 1814253a814b |
13 | 905817209b7 |
14 | 443b88782a7 |
15 | 225d805ebc5 |
hex | 121f28814cb |
1245314553035 has 24 divisors (see below), whose sum is σ = 1738406506320. Its totient is φ = 853905885504.
The previous prime is 1245314553019. The next prime is 1245314553073. The reversal of 1245314553035 is 5303554135421.
It is not a de Polignac number, because 1245314553035 - 24 = 1245314553019 is a prime.
It is a super-2 number, since 2×12453145530352 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1245314552983 and 1245314553001.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15644957 + ... + 15724353.
It is an arithmetic number, because the mean of its divisors is an integer number (72433604430).
Almost surely, 21245314553035 is an apocalyptic number.
1245314553035 is a deficient number, since it is larger than the sum of its proper divisors (493091953285).
1245314553035 is an equidigital number, since it uses as much as digits as its factorization.
1245314553035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143435 (or 143428 counting only the distinct ones).
The product of its (nonzero) digits is 540000, while the sum is 41.
Adding to 1245314553035 its reverse (5303554135421), we get a palindrome (6548868688456).
The spelling of 1245314553035 in words is "one trillion, two hundred forty-five billion, three hundred fourteen million, five hundred fifty-three thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •