Base | Representation |
---|---|
bin | 10110101101011… |
… | …000011000001001 |
3 | 222112220112222221 |
4 | 112231120120021 |
5 | 1240013320311 |
6 | 101450014041 |
7 | 12304255555 |
oct | 2655303011 |
9 | 875815887 |
10 | 380995081 |
11 | 186075275 |
12 | a7717321 |
13 | 60c1909c |
14 | 38858865 |
15 | 236ac671 |
hex | 16b58609 |
380995081 has 4 divisors (see below), whose sum is σ = 387240964. Its totient is φ = 374749200.
The previous prime is 380995079. The next prime is 380995091. The reversal of 380995081 is 180599083.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 116640000 + 264355081 = 10800^2 + 16259^2 .
It is a cyclic number.
It is not a de Polignac number, because 380995081 - 21 = 380995079 is a prime.
It is a super-2 number, since 2×3809950812 = 290314503492393122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (380995051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3122850 + ... + 3122971.
It is an arithmetic number, because the mean of its divisors is an integer number (96810241).
Almost surely, 2380995081 is an apocalyptic number.
It is an amenable number.
380995081 is a deficient number, since it is larger than the sum of its proper divisors (6245883).
380995081 is an equidigital number, since it uses as much as digits as its factorization.
380995081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6245882.
The product of its (nonzero) digits is 77760, while the sum is 43.
The square root of 380995081 is about 19519.0952915344. The cubic root of 380995081 is about 724.9473325197.
The spelling of 380995081 in words is "three hundred eighty million, nine hundred ninety-five thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •