Base | Representation |
---|---|
bin | 11110011011101011100… |
… | …10110111001101011111 |
3 | 10200222000101012101211212 |
4 | 33031311302313031133 |
5 | 114112444222224133 |
6 | 2120211055335035 |
7 | 135355156400636 |
oct | 17156562671537 |
9 | 3628011171755 |
10 | 1045653320543 |
11 | 373506048377 |
12 | 14a7a322147b |
13 | 777b2654190 |
14 | 3887777c51d |
15 | 1c2ee706148 |
hex | f375cb735f |
1045653320543 has 16 divisors (see below), whose sum is σ = 1133085144576. Its totient is φ = 959223656160.
The previous prime is 1045653320381. The next prime is 1045653320597. The reversal of 1045653320543 is 3450233565401.
It is a cyclic number.
It is not a de Polignac number, because 1045653320543 - 28 = 1045653320287 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1045653320543.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1045653325543) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10071728 + ... + 10175018.
It is an arithmetic number, because the mean of its divisors is an integer number (70817821536).
Almost surely, 21045653320543 is an apocalyptic number.
1045653320543 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1045653320543 is a deficient number, since it is larger than the sum of its proper divisors (87431824033).
1045653320543 is a wasteful number, since it uses less digits than its factorization.
1045653320543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108134.
The product of its (nonzero) digits is 648000, while the sum is 41.
Adding to 1045653320543 its reverse (3450233565401), we get a palindrome (4495886885944).
The spelling of 1045653320543 in words is "one trillion, forty-five billion, six hundred fifty-three million, three hundred twenty thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •