Base | Representation |
---|---|
bin | 10000101010101010000… |
… | …111010011110010100011 |
3 | 11001111020222212201210011 |
4 | 100222222013103302203 |
5 | 122231101211443043 |
6 | 2234052310345351 |
7 | 145513660535461 |
oct | 20525207236243 |
9 | 4044228781704 |
10 | 1145315343523 |
11 | 4017a872031a |
12 | 165b7795b257 |
13 | 8400612a000 |
14 | 3d60d981831 |
15 | 1ebd3e2e59d |
hex | 10aaa1d3ca3 |
1145315343523 has 8 divisors (see below), whose sum is σ = 1240714848800. Its totient is φ = 1057214161224.
The previous prime is 1145315343511. The next prime is 1145315343551. The reversal of 1145315343523 is 3253435135411.
It is not a de Polignac number, because 1145315343523 - 217 = 1145315212451 is a prime.
It is a super-2 number, since 2×11453153435232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1145315343323) 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 7 ways as a sum of consecutive naturals, for example, 260652183 + ... + 260656576.
It is an arithmetic number, because the mean of its divisors is an integer number (155089356100).
Almost surely, 21145315343523 is an apocalyptic number.
1145315343523 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1145315343523 is a deficient number, since it is larger than the sum of its proper divisors (95399505277).
1145315343523 is an frugal number, since it uses more digits than its factorization.
1145315343523 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 521308798 (or 521308772 counting only the distinct ones).
The product of its digits is 324000, while the sum is 40.
The spelling of 1145315343523 in words is "one trillion, one hundred forty-five billion, three hundred fifteen million, three hundred forty-three thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •