Base | Representation |
---|---|
bin | 11011100010001001011… |
… | …11000011101111011101 |
3 | 10100102220120102211102210 |
4 | 31301010233003233131 |
5 | 111000000233220101 |
6 | 2002335120511033 |
7 | 125230621151613 |
oct | 15610457035735 |
9 | 3312816384383 |
10 | 946045991901 |
11 | 33524133205a |
12 | 133424a7b479 |
13 | 6b29a2bb36a |
14 | 33b089356b3 |
15 | 1991ebd37d6 |
hex | dc44bc3bdd |
946045991901 has 4 divisors (see below), whose sum is σ = 1261394655872. Its totient is φ = 630697327932.
The previous prime is 946045991873. The next prime is 946045991921. The reversal of 946045991901 is 109199540649.
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, and also an emirpimes, since its reverse is a distinct semiprime: 109199540649 = 3 ⋅36399846883.
It is not a de Polignac number, because 946045991901 - 27 = 946045991773 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (946045991921) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 157674331981 + ... + 157674331986.
It is an arithmetic number, because the mean of its divisors is an integer number (315348663968).
Almost surely, 2946045991901 is an apocalyptic number.
It is an amenable number.
946045991901 is a deficient number, since it is larger than the sum of its proper divisors (315348663971).
946045991901 is a wasteful number, since it uses less digits than its factorization.
946045991901 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 315348663970.
The product of its (nonzero) digits is 3149280, while the sum is 57.
The spelling of 946045991901 in words is "nine hundred forty-six billion, forty-five million, nine hundred ninety-one thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •