Base | Representation |
---|---|
bin | 11110010111011001100… |
… | …00001000000010100101 |
3 | 10200202002010212010202010 |
4 | 33023230300020002211 |
5 | 114043242123440303 |
6 | 2115151003504433 |
7 | 135244200505224 |
oct | 17135460100245 |
9 | 3622063763663 |
10 | 1043354124453 |
11 | 372536226313 |
12 | 14a261228119 |
13 | 77507200c14 |
14 | 386da27ccbb |
15 | 1c217942c03 |
hex | f2ecc080a5 |
1043354124453 has 8 divisors (see below), whose sum is σ = 1391143811616. Its totient is φ = 695566926800.
The previous prime is 1043354124427. The next prime is 1043354124467. The reversal of 1043354124453 is 3544214533401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1043354124453 - 212 = 1043354120357 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1043354124853) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 859738 + ... + 1681028.
It is an arithmetic number, because the mean of its divisors is an integer number (173892976452).
Almost surely, 21043354124453 is an apocalyptic number.
It is an amenable number.
1043354124453 is a deficient number, since it is larger than the sum of its proper divisors (347789687163).
1043354124453 is an equidigital number, since it uses as much as digits as its factorization.
1043354124453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1244755.
The product of its (nonzero) digits is 345600, while the sum is 39.
Adding to 1043354124453 its reverse (3544214533401), we get a palindrome (4587568657854).
The spelling of 1043354124453 in words is "one trillion, forty-three billion, three hundred fifty-four million, one hundred twenty-four thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •