Base | Representation |
---|---|
bin | 100010001000000… |
… | …0010110001000001 |
3 | 2221210121212222101 |
4 | 1010100002301001 |
5 | 4321113300241 |
6 | 305342310401 |
7 | 40242550423 |
oct | 10420026101 |
9 | 2853555871 |
10 | 1145056321 |
11 | 538399842 |
12 | 27b588401 |
13 | 1532c7b26 |
14 | ac10a813 |
15 | 6a7d5e31 |
hex | 44402c41 |
1145056321 has 2 divisors, whose sum is σ = 1145056322. Its totient is φ = 1145056320.
The previous prime is 1145056313. The next prime is 1145056343. The reversal of 1145056321 is 1236505411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 616975921 + 528080400 = 24839^2 + 22980^2 .
It is an emirp because it is prime and its reverse (1236505411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1145056321 - 23 = 1145056313 is a prime.
It is a super-2 number, since 2×11450563212 = 2622307956524110082, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1145056321.
It is not a weakly prime, because it can be changed into another prime (1145056391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 572528160 + 572528161.
It is an arithmetic number, because the mean of its divisors is an integer number (572528161).
Almost surely, 21145056321 is an apocalyptic number.
It is an amenable number.
1145056321 is a deficient number, since it is larger than the sum of its proper divisors (1).
1145056321 is an equidigital number, since it uses as much as digits as its factorization.
1145056321 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3600, while the sum is 28.
The square root of 1145056321 is about 33838.6808401273. The cubic root of 1145056321 is about 1046.1861095482.
The spelling of 1145056321 in words is "one billion, one hundred forty-five million, fifty-six thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •