Base | Representation |
---|---|
bin | 1110000001110101… |
… | …0101010101100100 |
3 | 100201102222202011221 |
4 | 3200131111111210 |
5 | 30203020122311 |
6 | 1421401510124 |
7 | 162214436542 |
oct | 34035252544 |
9 | 10642882157 |
10 | 3765785956 |
11 | 16627627a9 |
12 | 8911a2344 |
13 | 48024831a |
14 | 27a1c6d92 |
15 | 17090d671 |
hex | e0755564 |
3765785956 has 27 divisors (see below), whose sum is σ = 6713277753. Its totient is φ = 1848343920.
The previous prime is 3765785953. The next prime is 3765786001. The reversal of 3765785956 is 6595875673.
The square root of 3765785956 is 61366.
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., 122456356 + 3643329600 = 11066^2 + 60360^2 .
It is a super-2 number, since 2×37657859562 = 28362287732813667872, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (61).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3765785894 and 3765785903.
It is not an unprimeable number, because it can be changed into a prime (3765785953) 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, 7486401 + ... + 7486903.
Almost surely, 23765785956 is an apocalyptic number.
3765785956 is the 61366-th square number.
It is an amenable number.
3765785956 is a deficient number, since it is larger than the sum of its proper divisors (2947491797).
3765785956 is an frugal number, since it uses more digits than its factorization.
3765785956 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1132 (or 566 counting only the distinct ones).
The product of its digits is 47628000, while the sum is 61.
The cubic root of 3765785956 is about 1555.7932293536.
The spelling of 3765785956 in words is "three billion, seven hundred sixty-five million, seven hundred eighty-five thousand, nine hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •