Base | Representation |
---|---|
bin | 1011111011010110… |
… | …1101000001000000 |
3 | 22021010122201000101 |
4 | 2332311231001000 |
5 | 23024121432211 |
6 | 1245412332144 |
7 | 142225263232 |
oct | 27665550100 |
9 | 8233581011 |
10 | 3201749056 |
11 | 13a3338500 |
12 | 754314054 |
13 | 3c043198c |
14 | 225322252 |
15 | 13b1465c1 |
hex | bed6d040 |
3201749056 has 63 divisors (see below), whose sum is σ = 6994444863. Its totient is φ = 1453077120.
The previous prime is 3201749041. The next prime is 3201749059. The reversal of 3201749056 is 6509471023.
The square root of 3201749056 is 56584.
It is a perfect power (a square), and thus also a powerful number.
It is a super-2 number, since 2×32017490562 = 20502394035193782272, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3201749059) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 4979071 + ... + 4979713.
Almost surely, 23201749056 is an apocalyptic number.
3201749056 is the 56584-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3201749056
3201749056 is an abundant number, since it is smaller than the sum of its proper divisors (3792695807).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3201749056 is an frugal number, since it uses more digits than its factorization.
3201749056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1320 (or 656 counting only the distinct ones).
The product of its (nonzero) digits is 45360, while the sum is 37.
The cubic root of 3201749056 is about 1473.8810329468.
It can be divided in two parts, 3201 and 749056, that added together give a palindrome (752257).
The spelling of 3201749056 in words is "three billion, two hundred one million, seven hundred forty-nine thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •