Base | Representation |
---|---|
bin | 11110010111101100001… |
… | …10110001010001010101 |
3 | 10200202111002011001121002 |
4 | 33023312012301101111 |
5 | 114044102312233240 |
6 | 2115214331233045 |
7 | 135251114423045 |
oct | 17136606612125 |
9 | 3622432131532 |
10 | 1043511055445 |
11 | 372606871951 |
12 | 14a2a58a8785 |
13 | 775308887b1 |
14 | 3871304d725 |
15 | 1c2265e0d15 |
hex | f2f61b1455 |
1043511055445 has 4 divisors (see below), whose sum is σ = 1252213266540. Its totient is φ = 834808844352.
The previous prime is 1043511055441. The next prime is 1043511055469. The reversal of 1043511055445 is 5445501153401.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 393808961764 + 649702093681 = 627542^2 + 806041^2 .
It is a cyclic number.
It is not a de Polignac number, because 1043511055445 - 22 = 1043511055441 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1043511055399 and 1043511055408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1043511055441) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 104351105540 + ... + 104351105549.
It is an arithmetic number, because the mean of its divisors is an integer number (313053316635).
Almost surely, 21043511055445 is an apocalyptic number.
It is an amenable number.
1043511055445 is a deficient number, since it is larger than the sum of its proper divisors (208702211095).
1043511055445 is an equidigital number, since it uses as much as digits as its factorization.
1043511055445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208702211094.
The product of its (nonzero) digits is 120000, while the sum is 38.
The spelling of 1043511055445 in words is "one trillion, forty-three billion, five hundred eleven million, fifty-five thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •