Base | Representation |
---|---|
bin | 10001110010100000… |
… | …00111010001100001 |
3 | 220122120212122011210 |
4 | 20321100013101201 |
5 | 124024404210001 |
6 | 4215403300333 |
7 | 455445366465 |
oct | 107120072141 |
9 | 26576778153 |
10 | 9550460001 |
11 | 4060a92a55 |
12 | 1a2651a6a9 |
13 | b92821c84 |
14 | 6685844a5 |
15 | 3ad6b0dd6 |
hex | 239407461 |
9550460001 has 4 divisors (see below), whose sum is σ = 12733946672. Its totient is φ = 6366973332.
The previous prime is 9550459999. The next prime is 9550460069. The reversal of 9550460001 is 1000640559.
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.
It is not a de Polignac number, because 9550460001 - 21 = 9550459999 is a prime.
It is a super-2 number, since 2×95504600012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (9550460081) 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, 1591743331 + ... + 1591743336.
It is an arithmetic number, because the mean of its divisors is an integer number (3183486668).
Almost surely, 29550460001 is an apocalyptic number.
It is an amenable number.
9550460001 is a deficient number, since it is larger than the sum of its proper divisors (3183486671).
9550460001 is a wasteful number, since it uses less digits than its factorization.
9550460001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3183486670.
The product of its (nonzero) digits is 5400, while the sum is 30.
The square root of 9550460001 is about 97726.4549699824. The cubic root of 9550460001 is about 2121.6549911338.
The spelling of 9550460001 in words is "nine billion, five hundred fifty million, four hundred sixty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •