Base | Representation |
---|---|
bin | 10110001011100… |
… | …110100101110001 |
3 | 221221020200122211 |
4 | 112023212211301 |
5 | 1230231443101 |
6 | 100532132121 |
7 | 12136066303 |
oct | 2613464561 |
9 | 857220584 |
10 | 372140401 |
11 | 181077656 |
12 | a4767041 |
13 | 5c138929 |
14 | 375d1973 |
15 | 22a0dc51 |
hex | 162e6971 |
372140401 has 8 divisors (see below), whose sum is σ = 379917864. Its totient is φ = 364391040.
The previous prime is 372140371. The next prime is 372140449. The reversal of 372140401 is 104041273.
It can be written as a sum of positive squares in 4 ways, for example, as 83174400 + 288966001 = 9120^2 + 16999^2 .
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 372140401 - 217 = 372009329 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (372140471) 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, 20875 + ... + 34351.
It is an arithmetic number, because the mean of its divisors is an integer number (47489733).
Almost surely, 2372140401 is an apocalyptic number.
It is an amenable number.
372140401 is a deficient number, since it is larger than the sum of its proper divisors (7777463).
372140401 is a wasteful number, since it uses less digits than its factorization.
372140401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14051.
The product of its (nonzero) digits is 672, while the sum is 22.
The square root of 372140401 is about 19290.9409049948. The cubic root of 372140401 is about 719.2871036552.
Adding to 372140401 its reverse (104041273), we get a palindrome (476181674).
It can be divided in two parts, 3721 and 40401, that multiplied together give a square (150332121 = 122612).
The spelling of 372140401 in words is "three hundred seventy-two million, one hundred forty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •