Base | Representation |
---|---|
bin | 100010100100111001011… |
… | …1101100111110111100001 |
3 | 121211022011101022000200201 |
4 | 1011021302331213313201 |
5 | 1110324412110223311 |
6 | 14035040252345201 |
7 | 1000222006334101 |
oct | 105116275476741 |
9 | 17738141260621 |
10 | 4752162586081 |
11 | 1572420989239 |
12 | 649001775201 |
13 | 286186067311 |
14 | 126012273201 |
15 | 839346d39c1 |
hex | 45272f67de1 |
4752162586081 has 4 divisors (see below), whose sum is σ = 4752173002500. Its totient is φ = 4752152169664.
The previous prime is 4752162586027. The next prime is 4752162586133. The reversal of 4752162586081 is 1806852612574.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2718158931856 + 2034003654225 = 1648684^2 + 1426185^2 .
It is a cyclic number.
It is not a de Polignac number, because 4752162586081 - 229 = 4751625715169 is a prime.
It is a super-2 number, since 2×47521625860812 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4752162506081) 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, 4490956 + ... + 5447293.
It is an arithmetic number, because the mean of its divisors is an integer number (1188043250625).
Almost surely, 24752162586081 is an apocalyptic number.
It is an amenable number.
4752162586081 is a deficient number, since it is larger than the sum of its proper divisors (10416419).
4752162586081 is an equidigital number, since it uses as much as digits as its factorization.
4752162586081 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10416418.
The product of its (nonzero) digits is 6451200, while the sum is 55.
The spelling of 4752162586081 in words is "four trillion, seven hundred fifty-two billion, one hundred sixty-two million, five hundred eighty-six thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •