Base | Representation |
---|---|
bin | 1100101000001001… |
… | …1010001101000011 |
3 | 22202020012000012010 |
4 | 3022002122031003 |
5 | 23420221114001 |
6 | 1320203304003 |
7 | 146666242011 |
oct | 31202321503 |
9 | 8666160163 |
10 | 3389629251 |
11 | 148a3a2698 |
12 | 7a721b003 |
13 | 4203345a8 |
14 | 24226b8b1 |
15 | 14c8a98d6 |
hex | ca09a343 |
3389629251 has 8 divisors (see below), whose sum is σ = 4520248144. Its totient is φ = 2259381600.
The previous prime is 3389629231. The next prime is 3389629259. The reversal of 3389629251 is 1529269833.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3389629251 - 210 = 3389628227 is a prime.
It is a super-2 number, since 2×33896292512 = 22979172918469642002, which contains 22 as substring.
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 3389629251.
It is not an unprimeable number, because it can be changed into a prime (3389629259) 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 7 ways as a sum of consecutive naturals, for example, 70756 + ... + 108561.
It is an arithmetic number, because the mean of its divisors is an integer number (565031018).
Almost surely, 23389629251 is an apocalyptic number.
3389629251 is a deficient number, since it is larger than the sum of its proper divisors (1130618893).
3389629251 is a wasteful number, since it uses less digits than its factorization.
3389629251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185621.
The product of its digits is 699840, while the sum is 48.
The square root of 3389629251 is about 58220.5225929826. The cubic root of 3389629251 is about 1502.1641725143.
The spelling of 3389629251 in words is "three billion, three hundred eighty-nine million, six hundred twenty-nine thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •