Base | Representation |
---|---|
bin | 100010111110001010… |
… | …0011001000010100001 |
3 | 21011211212012121222002 |
4 | 1011330110121002201 |
5 | 2212301120224012 |
6 | 54300041053345 |
7 | 5266023602126 |
oct | 1057424310241 |
9 | 234755177862 |
10 | 75100164257 |
11 | 299390a2a58 |
12 | 1267aa87255 |
13 | 710ac76721 |
14 | 38c610c74d |
15 | 1e482507c2 |
hex | 117c5190a1 |
75100164257 has 4 divisors (see below), whose sum is σ = 79517820996. Its totient is φ = 70682507520.
The previous prime is 75100164203. The next prime is 75100164277. The reversal of 75100164257 is 75246100157.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 75246100157 = 63029 ⋅1193833.
It can be written as a sum of positive squares in 2 ways, for example, as 46915126801 + 28185037456 = 216599^2 + 167884^2 .
It is not a de Polignac number, because 75100164257 - 26 = 75100164193 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 75100164257.
It is not an unprimeable number, because it can be changed into a prime (75100164277) 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, 2208828344 + ... + 2208828377.
It is an arithmetic number, because the mean of its divisors is an integer number (19879455249).
Almost surely, 275100164257 is an apocalyptic number.
It is an amenable number.
75100164257 is a deficient number, since it is larger than the sum of its proper divisors (4417656739).
75100164257 is a wasteful number, since it uses less digits than its factorization.
75100164257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4417656738.
The product of its (nonzero) digits is 58800, while the sum is 38.
The spelling of 75100164257 in words is "seventy-five billion, one hundred million, one hundred sixty-four thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •