Base | Representation |
---|---|
bin | 10010001101000… |
… | …101010110100001 |
3 | 210021200221001001 |
4 | 102031011112201 |
5 | 1111141412211 |
6 | 50150112001 |
7 | 10366011250 |
oct | 2215052641 |
9 | 707627031 |
10 | 305419681 |
11 | 147446366 |
12 | 8634b601 |
13 | 4b377908 |
14 | 2c7c4797 |
15 | 1bc2eac1 |
hex | 123455a1 |
305419681 has 8 divisors (see below), whose sum is σ = 349285824. Its totient is φ = 261612240.
The previous prime is 305419679. The next prime is 305419687. The reversal of 305419681 is 186914503.
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 305419681 - 21 = 305419679 is a prime.
It is a super-2 number, since 2×3054196812 = 186562363084283522, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 305419681.
It is not an unprimeable number, because it can be changed into a prime (305419687) 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, 2890 + ... + 24883.
It is an arithmetic number, because the mean of its divisors is an integer number (43660728).
Almost surely, 2305419681 is an apocalyptic number.
It is an amenable number.
305419681 is a deficient number, since it is larger than the sum of its proper divisors (43866143).
305419681 is a wasteful number, since it uses less digits than its factorization.
305419681 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29351.
The product of its (nonzero) digits is 25920, while the sum is 37.
The square root of 305419681 is about 17476.2604981729. The cubic root of 305419681 is about 673.4401519637.
It can be divided in two parts, 305 and 419681, that added together give a triangular number (419986 = T916).
The spelling of 305419681 in words is "three hundred five million, four hundred nineteen thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •