Base | Representation |
---|---|
bin | 1101101100100010… |
… | …1010100110100100 |
3 | 100111012221122010101 |
4 | 3123020222212210 |
5 | 30012134410311 |
6 | 1404451433444 |
7 | 160051403200 |
oct | 33310524644 |
9 | 10435848111 |
10 | 3676481956 |
11 | 1617307344 |
12 | 8672b5884 |
13 | 4678ab114 |
14 | 26c3bbb00 |
15 | 167b6cec1 |
hex | db22a9a4 |
3676481956 has 81 divisors (see below), whose sum is σ = 7717649121. Its totient is φ = 1527976800.
The previous prime is 3676481953. The next prime is 3676481957. The reversal of 3676481956 is 6591846763.
The square root of 3676481956 is 60634.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 119552356 + 3556929600 = 10934^2 + 59640^2 .
It is a junction number, because it is equal to n+sod(n) for n = 3676481897 and 3676481906.
It is not an unprimeable number, because it can be changed into a prime (3676481951) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 51781401 + ... + 51781471.
Almost surely, 23676481956 is an apocalyptic number.
3676481956 is the 60634-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3676481956
3676481956 is an abundant number, since it is smaller than the sum of its proper divisors (4041167165).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3676481956 is an equidigital number, since it uses as much as digits as its factorization.
3676481956 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282 (or 141 counting only the distinct ones).
The product of its digits is 6531840, while the sum is 55.
The cubic root of 3676481956 is about 1543.3963882369.
The spelling of 3676481956 in words is "three billion, six hundred seventy-six million, four hundred eighty-one thousand, nine hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •