Base | Representation |
---|---|
bin | 1011010110011101… |
… | …1101100001100001 |
3 | 21212100111200112100 |
4 | 2311213131201201 |
5 | 22220014130031 |
6 | 1222204121013 |
7 | 135336151050 |
oct | 26547354141 |
9 | 7770450470 |
10 | 3047020641 |
11 | 1323a66785 |
12 | 710536169 |
13 | 3973687c2 |
14 | 20c966397 |
15 | 12c780de6 |
hex | b59dd861 |
3047020641 has 12 divisors (see below), whose sum is σ = 5030002432. Its totient is φ = 1741154616.
The previous prime is 3047020637. The next prime is 3047020651. The reversal of 3047020641 is 1460207403.
It is not a de Polignac number, because 3047020641 - 22 = 3047020637 is a prime.
It is not an unprimeable number, because it can be changed into a prime (3047020651) 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 11 ways as a sum of consecutive naturals, for example, 24182641 + ... + 24182766.
Almost surely, 23047020641 is an apocalyptic number.
It is an amenable number.
3047020641 is a deficient number, since it is larger than the sum of its proper divisors (1982981791).
3047020641 is a wasteful number, since it uses less digits than its factorization.
3047020641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48365420 (or 48365417 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 27.
The square root of 3047020641 is about 55199.8246464606. The cubic root of 3047020641 is about 1449.7455980155.
The spelling of 3047020641 in words is "three billion, forty-seven million, twenty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •