Base | Representation |
---|---|
bin | 1000111000001001010… |
… | …11010100101111101001 |
3 | 1002011022110002120110221 |
4 | 10130010223110233221 |
5 | 14444140403102131 |
6 | 352042541410041 |
7 | 31015464642265 |
oct | 4340453245751 |
9 | 1064273076427 |
10 | 305021144041 |
11 | 1083a4536119 |
12 | 4b146b69921 |
13 | 229c0181563 |
14 | 10a97d490a5 |
15 | 7e033e0411 |
hex | 4704ad4be9 |
305021144041 has 8 divisors (see below), whose sum is σ = 310256079840. Its totient is φ = 299788377888.
The previous prime is 305021144009. The next prime is 305021144081. The reversal of 305021144041 is 140441120503.
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 305021144041 - 25 = 305021144009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 305021143997 and 305021144015.
It is not an unprimeable number, because it can be changed into a prime (305021144081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 257556 + ... + 822421.
It is an arithmetic number, because the mean of its divisors is an integer number (38782009980).
Almost surely, 2305021144041 is an apocalyptic number.
It is an amenable number.
305021144041 is a deficient number, since it is larger than the sum of its proper divisors (5234935799).
305021144041 is a wasteful number, since it uses less digits than its factorization.
305021144041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1084823.
The product of its (nonzero) digits is 1920, while the sum is 25.
Adding to 305021144041 its reverse (140441120503), we get a palindrome (445462264544).
The spelling of 305021144041 in words is "three hundred five billion, twenty-one million, one hundred forty-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •