Base | Representation |
---|---|
bin | 10001000010101001… |
… | …11010001000001011 |
3 | 212121121120120221210 |
4 | 20201110322020023 |
5 | 122214130014231 |
6 | 4111504104203 |
7 | 442502521035 |
oct | 104124721013 |
9 | 25547516853 |
10 | 9149063691 |
11 | 3975453a69 |
12 | 1934005063 |
13 | b2a611c71 |
14 | 62b138c55 |
15 | 388323a46 |
hex | 22153a20b |
9149063691 has 4 divisors (see below), whose sum is σ = 12198751592. Its totient is φ = 6099375792.
The previous prime is 9149063669. The next prime is 9149063731. The reversal of 9149063691 is 1963609419.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1963609419 = 3 ⋅654536473.
It is not a de Polignac number, because 9149063691 - 25 = 9149063659 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 9149063691.
It is not an unprimeable number, because it can be changed into a prime (9149063491) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1524843946 + ... + 1524843951.
It is an arithmetic number, because the mean of its divisors is an integer number (3049687898).
Almost surely, 29149063691 is an apocalyptic number.
9149063691 is a deficient number, since it is larger than the sum of its proper divisors (3049687901).
9149063691 is a wasteful number, since it uses less digits than its factorization.
9149063691 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3049687900.
The product of its (nonzero) digits is 314928, while the sum is 48.
The square root of 9149063691 is about 95650.7380577902. The cubic root of 9149063691 is about 2091.5048867945.
The spelling of 9149063691 in words is "nine billion, one hundred forty-nine million, sixty-three thousand, six hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •