Base | Representation |
---|---|
bin | 10010001100010… |
… | …101010111100101 |
3 | 210021022221102210 |
4 | 102030111113211 |
5 | 1111114120031 |
6 | 50141554033 |
7 | 10364232246 |
oct | 2214252745 |
9 | 707287383 |
10 | 305223141 |
11 | 147321733 |
12 | 86275919 |
13 | 4b309312 |
14 | 2c772ccd |
15 | 1bbe1746 |
hex | 123155e5 |
305223141 has 8 divisors (see below), whose sum is σ = 408403360. Its totient is φ = 202762512.
The previous prime is 305223137. The next prime is 305223143. The reversal of 305223141 is 141322503.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 305223141 - 22 = 305223137 is a prime.
It is a super-2 number, since 2×3052231412 = 186322331603811762, 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 (305223143) 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, 178906 + ... + 180603.
It is an arithmetic number, because the mean of its divisors is an integer number (51050420).
Almost surely, 2305223141 is an apocalyptic number.
It is an amenable number.
305223141 is a deficient number, since it is larger than the sum of its proper divisors (103180219).
305223141 is a wasteful number, since it uses less digits than its factorization.
305223141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 359795.
The product of its (nonzero) digits is 720, while the sum is 21.
The square root of 305223141 is about 17470.6365367722. The cubic root of 305223141 is about 673.2956662642.
Adding to 305223141 its reverse (141322503), we get a palindrome (446545644).
It can be divided in two parts, 305 and 223141, that added together give a triangular number (223446 = T668).
The spelling of 305223141 in words is "three hundred five million, two hundred twenty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •