Base | Representation |
---|---|
bin | 111011101111011111000… |
… | …000110100001011001001 |
3 | 112112110211211210220211202 |
4 | 323233133000310023021 |
5 | 1014230412414104203 |
6 | 12422002210233545 |
7 | 602415341163656 |
oct | 73573700641311 |
9 | 15473754726752 |
10 | 4105435300553 |
11 | 13431182204a4 |
12 | 5637b1b858b5 |
13 | 23a1aa6b7b42 |
14 | 1029c01b4c2d |
15 | 71bd2484388 |
hex | 3bbdf0342c9 |
4105435300553 has 4 divisors (see below), whose sum is σ = 4145293895808. Its totient is φ = 4065576705300.
The previous prime is 4105435300541. The next prime is 4105435300657. The reversal of 4105435300553 is 3550035345014.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4105435300553 - 214 = 4105435284169 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (4105435300523) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19929297473 + ... + 19929297678.
It is an arithmetic number, because the mean of its divisors is an integer number (1036323473952).
Almost surely, 24105435300553 is an apocalyptic number.
It is an amenable number.
4105435300553 is a deficient number, since it is larger than the sum of its proper divisors (39858595255).
4105435300553 is a wasteful number, since it uses less digits than its factorization.
4105435300553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39858595254.
The product of its (nonzero) digits is 270000, while the sum is 38.
The spelling of 4105435300553 in words is "four trillion, one hundred five billion, four hundred thirty-five million, three hundred thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •