Base | Representation |
---|---|
bin | 10101010101011001101… |
… | …01001000110010101001 |
3 | 2121002010002201010012212 |
4 | 22222230311020302221 |
5 | 44002233234113423 |
6 | 1320431130014505 |
7 | 103650341424653 |
oct | 12525465106251 |
9 | 2532102633185 |
10 | 733044051113 |
11 | 262978290350 |
12 | ba09ab77435 |
13 | 5418339acca |
14 | 2769db416d3 |
15 | 14105077578 |
hex | aaacd48ca9 |
733044051113 has 4 divisors (see below), whose sum is σ = 799684419408. Its totient is φ = 666403682820.
The previous prime is 733044051107. The next prime is 733044051121. The reversal of 733044051113 is 311150440337.
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 733044051113 - 220 = 733043002537 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 733044051113.
It is not an unprimeable number, because it can be changed into a prime (733044051713) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33320184131 + ... + 33320184152.
It is an arithmetic number, because the mean of its divisors is an integer number (199921104852).
Almost surely, 2733044051113 is an apocalyptic number.
It is an amenable number.
733044051113 is a deficient number, since it is larger than the sum of its proper divisors (66640368295).
733044051113 is a wasteful number, since it uses less digits than its factorization.
733044051113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66640368294.
The product of its (nonzero) digits is 15120, while the sum is 32.
The spelling of 733044051113 in words is "seven hundred thirty-three billion, forty-four million, fifty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •