Base | Representation |
---|---|
bin | 100010101000100101010… |
… | …0100111110000011111101 |
3 | 121212001120210211202000120 |
4 | 1011101022210332003331 |
5 | 1110442113143004331 |
6 | 14042425342245153 |
7 | 1000622044435626 |
oct | 105211244760375 |
9 | 17761523752016 |
10 | 4760074969341 |
11 | 157581125295a |
12 | 64a64b5867b9 |
13 | 286b473b11c3 |
14 | 126563050a4d |
15 | 83c49173796 |
hex | 4544a93e0fd |
4760074969341 has 4 divisors (see below), whose sum is σ = 6346766625792. Its totient is φ = 3173383312892.
The previous prime is 4760074969289. The next prime is 4760074969357. The reversal of 4760074969341 is 1439694700674.
4760074969341 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 4760074969341 - 29 = 4760074968829 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4760074969361) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 793345828221 + ... + 793345828226.
It is an arithmetic number, because the mean of its divisors is an integer number (1586691656448).
Almost surely, 24760074969341 is an apocalyptic number.
It is an amenable number.
4760074969341 is a deficient number, since it is larger than the sum of its proper divisors (1586691656451).
4760074969341 is a wasteful number, since it uses less digits than its factorization.
4760074969341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1586691656450.
The product of its (nonzero) digits is 27433728, while the sum is 60.
The spelling of 4760074969341 in words is "four trillion, seven hundred sixty billion, seventy-four million, nine hundred sixty-nine thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •