Base | Representation |
---|---|
bin | 1110110010101011… |
… | …1100101111111111 |
3 | 101020201112112111221 |
4 | 3230222330233333 |
5 | 31112443304410 |
6 | 1454001254211 |
7 | 200253144640 |
oct | 35452745777 |
9 | 11221475457 |
10 | 3970681855 |
11 | 175838a058 |
12 | 929934367 |
13 | 4b3827bba |
14 | 2994c16c7 |
15 | 1838d34da |
hex | ecabcbff |
3970681855 has 8 divisors (see below), whose sum is σ = 5445506592. Its totient is φ = 2722753248.
The previous prime is 3970681853. The next prime is 3970681873. The reversal of 3970681855 is 5581860793.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3970681855 - 21 = 3970681853 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3970681853) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 56723992 + ... + 56724061.
It is an arithmetic number, because the mean of its divisors is an integer number (680688324).
Almost surely, 23970681855 is an apocalyptic number.
3970681855 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
3970681855 is a deficient number, since it is larger than the sum of its proper divisors (1474824737).
3970681855 is a wasteful number, since it uses less digits than its factorization.
3970681855 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113448065.
The product of its (nonzero) digits is 1814400, while the sum is 52.
The square root of 3970681855 is about 63013.3466418028. The cubic root of 3970681855 is about 1583.5132332861.
The spelling of 3970681855 in words is "three billion, nine hundred seventy million, six hundred eighty-one thousand, eight hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •