Base | Representation |
---|---|
bin | 1110000111101101… |
… | …0010010100100101 |
3 | 100210011100001001222 |
4 | 3201323102110211 |
5 | 30230321241031 |
6 | 1424041430125 |
7 | 162633666002 |
oct | 34173222445 |
9 | 10704301058 |
10 | 3790415141 |
11 | 1675654aa7 |
12 | 89949b345 |
13 | 48538c7c6 |
14 | 27d5988a9 |
15 | 172b75e7b |
hex | e1ed2525 |
3790415141 has 8 divisors (see below), whose sum is σ = 3828761664. Its totient is φ = 3752098560.
The previous prime is 3790415131. The next prime is 3790415143. The reversal of 3790415141 is 1415140973.
3790415141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 3790415141 - 26 = 3790415077 is a prime.
It is a super-2 number, since 2×37904151412 = 28734493882244099762, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3790415143) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 317246 + ... + 328976.
It is an arithmetic number, because the mean of its divisors is an integer number (478595208).
Almost surely, 23790415141 is an apocalyptic number.
It is an amenable number.
3790415141 is a deficient number, since it is larger than the sum of its proper divisors (38346523).
3790415141 is a wasteful number, since it uses less digits than its factorization.
3790415141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14971.
The product of its (nonzero) digits is 15120, while the sum is 35.
The square root of 3790415141 is about 61566.3474716505. The cubic root of 3790415141 is about 1559.1776211428.
The spelling of 3790415141 in words is "three billion, seven hundred ninety million, four hundred fifteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.020 sec. • engine limits •