Base | Representation |
---|---|
bin | 11001100111001001… |
… | …11101101111000110 |
3 | 1022111021111001111020 |
4 | 30303210331233012 |
5 | 211130024324313 |
6 | 10152231052010 |
7 | 664513011663 |
oct | 146344755706 |
9 | 38437431436 |
10 | 13750229958 |
11 | 5916712313 |
12 | 27b8b11006 |
13 | 13b194a05a |
14 | 94625aa6a |
15 | 557247323 |
hex | 33393dbc6 |
13750229958 has 8 divisors (see below), whose sum is σ = 27500459928. Its totient is φ = 4583409984.
The previous prime is 13750229951. The next prime is 13750229989. The reversal of 13750229958 is 85992205731.
It is a sphenic number, since it is the product of 3 distinct primes.
13750229958 is an admirable number.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a self number, because there is not a number n which added to its sum of digits gives 13750229958.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13750229951) 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, 1145852491 + ... + 1145852502.
It is an arithmetic number, because the mean of its divisors is an integer number (3437557491).
Almost surely, 213750229958 is an apocalyptic number.
13750229958 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13750229958 is a wasteful number, since it uses less digits than its factorization.
13750229958 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2291704998.
The product of its (nonzero) digits is 1360800, while the sum is 51.
The spelling of 13750229958 in words is "thirteen billion, seven hundred fifty million, two hundred twenty-nine thousand, nine hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •