Base | Representation |
---|---|
bin | 11101001111101… |
… | …01111001000101 |
3 | 122002121211011020 |
4 | 32213311321011 |
5 | 1000300403011 |
6 | 40202101353 |
7 | 6036142230 |
oct | 1647657105 |
9 | 562554136 |
10 | 245325381 |
11 | 116530654 |
12 | 6a1aa859 |
13 | 3ba96a62 |
14 | 24820417 |
15 | 1680e006 |
hex | e9f5e45 |
245325381 has 8 divisors (see below), whose sum is σ = 373829184. Its totient is φ = 140185920.
The previous prime is 245325361. The next prime is 245325389. The reversal of 245325381 is 183523542.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 245325381 - 27 = 245325253 is a prime.
It is a super-2 number, since 2×2453253812 = 120369085125590322, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (245325389) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5841060 + ... + 5841101.
It is an arithmetic number, because the mean of its divisors is an integer number (46728648).
Almost surely, 2245325381 is an apocalyptic number.
245325381 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
245325381 is a deficient number, since it is larger than the sum of its proper divisors (128503803).
245325381 is a wasteful number, since it uses less digits than its factorization.
245325381 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11682171.
The product of its digits is 28800, while the sum is 33.
The square root of 245325381 is about 15662.8663085656. The cubic root of 245325381 is about 626.0093608143.
The spelling of 245325381 in words is "two hundred forty-five million, three hundred twenty-five thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •