Base | Representation |
---|---|
bin | 1010001011111111… |
… | …1101011000100011 |
3 | 21001120202220112110 |
4 | 2202333331120203 |
5 | 21100034103431 |
6 | 1131205330403 |
7 | 124524233562 |
oct | 24277753043 |
9 | 7046686473 |
10 | 2734675491 |
11 | 1183720199 |
12 | 643a06a03 |
13 | 3477378a2 |
14 | 1bd29bbd9 |
15 | 110134346 |
hex | a2ffd623 |
2734675491 has 8 divisors (see below), whose sum is σ = 3838141120. Its totient is φ = 1727163432.
The previous prime is 2734675487. The next prime is 2734675501. The reversal of 2734675491 is 1945764372.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2734675491 - 22 = 2734675487 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 2734675491.
It is not an unprimeable number, because it can be changed into a prime (2734675481) 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 7 ways as a sum of consecutive naturals, for example, 23988325 + ... + 23988438.
It is an arithmetic number, because the mean of its divisors is an integer number (479767640).
Almost surely, 22734675491 is an apocalyptic number.
2734675491 is a deficient number, since it is larger than the sum of its proper divisors (1103465629).
2734675491 is a wasteful number, since it uses less digits than its factorization.
2734675491 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47976785.
The product of its digits is 1270080, while the sum is 48.
The square root of 2734675491 is about 52294.1248229665. The cubic root of 2734675491 is about 1398.4123994906.
It can be divided in two parts, 273 and 4675491, that added together give a palindrome (4675764).
The spelling of 2734675491 in words is "two billion, seven hundred thirty-four million, six hundred seventy-five thousand, four hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •