Base | Representation |
---|---|
bin | 10101100010101011000… |
… | …00101101011100010101 |
3 | 2121202111122120200111122 |
4 | 22301111200231130111 |
5 | 44111331231404023 |
6 | 1324010130413325 |
7 | 104322035542433 |
oct | 12612540553425 |
9 | 2552448520448 |
10 | 740169013013 |
11 | 2659a4125711 |
12 | bb549131245 |
13 | 54a4a5474b1 |
14 | 27b78109d53 |
15 | 143c08272c8 |
hex | ac5582d715 |
740169013013 has 4 divisors (see below), whose sum is σ = 740170751040. Its totient is φ = 740167274988.
The previous prime is 740169013009. The next prime is 740169013049. The reversal of 740169013013 is 310310961047.
It is a happy number.
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, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 740169013013 - 22 = 740169013009 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (740169019013) 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, 250706 + ... + 1242252.
It is an arithmetic number, because the mean of its divisors is an integer number (185042687760).
Almost surely, 2740169013013 is an apocalyptic number.
It is an amenable number.
740169013013 is a deficient number, since it is larger than the sum of its proper divisors (1738027).
740169013013 is an equidigital number, since it uses as much as digits as its factorization.
740169013013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1738026.
The product of its (nonzero) digits is 13608, while the sum is 35.
The spelling of 740169013013 in words is "seven hundred forty billion, one hundred sixty-nine million, thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •