Base | Representation |
---|---|
bin | 10101110011001100000… |
… | …01110111100010010001 |
3 | 2122121101121112010001112 |
4 | 22321212001313202101 |
5 | 44233011213401103 |
6 | 1332034042343105 |
7 | 105054545405522 |
oct | 12714601674221 |
9 | 2577347463045 |
10 | 749036075153 |
11 | 269734378743 |
12 | 1012027baa95 |
13 | 558315c0a22 |
14 | 283799d8849 |
15 | 1473dee4cd8 |
hex | ae66077891 |
749036075153 has 4 divisors (see below), whose sum is σ = 753521321280. Its totient is φ = 744550829028.
The previous prime is 749036075113. The next prime is 749036075231. The reversal of 749036075153 is 351570630947.
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 a de Polignac number, because none of the positive numbers 2k-749036075153 is a prime.
It is a super-2 number, since 2×7490360751532 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (749036075113) 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, 2242622813 + ... + 2242623146.
It is an arithmetic number, because the mean of its divisors is an integer number (188380330320).
Almost surely, 2749036075153 is an apocalyptic number.
It is an amenable number.
749036075153 is a deficient number, since it is larger than the sum of its proper divisors (4485246127).
749036075153 is a wasteful number, since it uses less digits than its factorization.
749036075153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4485246126.
The product of its (nonzero) digits is 2381400, while the sum is 50.
The spelling of 749036075153 in words is "seven hundred forty-nine billion, thirty-six million, seventy-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •