Base | Representation |
---|---|
bin | 101011101111000001… |
… | …0010110010101100011 |
3 | 22222102102001110110222 |
4 | 1113132002112111203 |
5 | 3014321341032242 |
6 | 111051312113255 |
7 | 6533261221361 |
oct | 1273602262543 |
9 | 288372043428 |
10 | 93919470947 |
11 | 36916102685 |
12 | 1625153582b |
13 | 8b19b59863 |
14 | 478d68c631 |
15 | 269a4e65d2 |
hex | 15de096563 |
93919470947 has 4 divisors (see below), whose sum is σ = 93923960280. Its totient is φ = 93914981616.
The previous prime is 93919470941. The next prime is 93919470979. The reversal of 93919470947 is 74907491939.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 74907491939 = 7 ⋅10701070277.
It is a cyclic number.
It is not a de Polignac number, because 93919470947 - 210 = 93919469923 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 93919470947.
It is not an unprimeable number, because it can be changed into a prime (93919470941) 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, 2213138 + ... + 2255175.
It is an arithmetic number, because the mean of its divisors is an integer number (23480990070).
Almost surely, 293919470947 is an apocalyptic number.
93919470947 is a deficient number, since it is larger than the sum of its proper divisors (4489333).
93919470947 is a wasteful number, since it uses less digits than its factorization.
93919470947 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4489332.
The product of its (nonzero) digits is 15431472, while the sum is 62.
The spelling of 93919470947 in words is "ninety-three billion, nine hundred nineteen million, four hundred seventy thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •