Base | Representation |
---|---|
bin | 111000101001110… |
… | …0011000110111011 |
3 | 11220110222021002121 |
4 | 1301103203012323 |
5 | 12343120344242 |
6 | 512343542111 |
7 | 65051544061 |
oct | 16123430673 |
9 | 4813867077 |
10 | 1900949947 |
11 | 896044916 |
12 | 45075a937 |
13 | 243aa7070 |
14 | 140674031 |
15 | b1d49667 |
hex | 714e31bb |
1900949947 has 8 divisors (see below), whose sum is σ = 2048968544. Its totient is φ = 1753187328.
The previous prime is 1900949933. The next prime is 1900949951. The reversal of 1900949947 is 7499490091.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1900949947 - 27 = 1900949819 is a prime.
It is a super-2 number, since 2×19009499472 = 7227221401998605618, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1900949894 and 1900949903.
It is not an unprimeable number, because it can be changed into a prime (1900949917) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48423 + ... + 78400.
It is an arithmetic number, because the mean of its divisors is an integer number (256121068).
Almost surely, 21900949947 is an apocalyptic number.
1900949947 is a deficient number, since it is larger than the sum of its proper divisors (148018597).
1900949947 is a wasteful number, since it uses less digits than its factorization.
1900949947 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127989.
The product of its (nonzero) digits is 734832, while the sum is 52.
The square root of 1900949947 is about 43599.8847131503. The cubic root of 1900949947 is about 1238.7687107775.
The spelling of 1900949947 in words is "one billion, nine hundred million, nine hundred forty-nine thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •