Base | Representation |
---|---|
bin | 10011110101011011110… |
… | …100010010101010110101 |
3 | 11211022020221202201020010 |
4 | 103311123310102222311 |
5 | 134313004014124240 |
6 | 2522101350130433 |
7 | 200322345623625 |
oct | 23653364225265 |
9 | 4738227681203 |
10 | 1363045067445 |
11 | 486078451516 |
12 | 1a0201050a19 |
13 | 9b6c4688089 |
14 | 49d86616885 |
15 | 256c8b70280 |
hex | 13d5bd12ab5 |
1363045067445 has 32 divisors (see below), whose sum is σ = 2236727727360. Its totient is φ = 708381109760.
The previous prime is 1363045067411. The next prime is 1363045067459. The reversal of 1363045067445 is 5447605403631.
It is not a de Polignac number, because 1363045067445 - 26 = 1363045067381 is a prime.
It is a super-2 number, since 2×13630450674452 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1363045067394 and 1363045067403.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 804834 + ... + 1836803.
It is an arithmetic number, because the mean of its divisors is an integer number (69897741480).
Almost surely, 21363045067445 is an apocalyptic number.
1363045067445 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1363045067445 is a deficient number, since it is larger than the sum of its proper divisors (873682659915).
1363045067445 is a wasteful number, since it uses less digits than its factorization.
1363045067445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2642525.
The product of its (nonzero) digits is 3628800, while the sum is 48.
The spelling of 1363045067445 in words is "one trillion, three hundred sixty-three billion, forty-five million, sixty-seven thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •