Base | Representation |
---|---|
bin | 1000111000101011110… |
… | …01010100011000011001 |
3 | 1002012001120200020222122 |
4 | 10130111321110120121 |
5 | 20000233331301431 |
6 | 352131341231025 |
7 | 31025603252444 |
oct | 4342571243031 |
9 | 1065046606878 |
10 | 305310025241 |
11 | 108532605911 |
12 | 4b207862475 |
13 | 22a37c88490 |
14 | 10ac446665b |
15 | 7e1d954a7b |
hex | 4715e54619 |
305310025241 has 16 divisors (see below), whose sum is σ = 334219681488. Its totient is φ = 277176211200.
The previous prime is 305310025231. The next prime is 305310025261. The reversal of 305310025241 is 142520013503.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 959202841 + 304350822400 = 30971^2 + 551680^2 .
It is a cyclic number.
It is not a de Polignac number, because 305310025241 - 218 = 305309763097 is a prime.
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 305310025241.
It is not an unprimeable number, because it can be changed into a prime (305310025231) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14311715 + ... + 14333031.
It is an arithmetic number, because the mean of its divisors is an integer number (20888730093).
Almost surely, 2305310025241 is an apocalyptic number.
It is an amenable number.
305310025241 is a deficient number, since it is larger than the sum of its proper divisors (28909656247).
305310025241 is a wasteful number, since it uses less digits than its factorization.
305310025241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39452.
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 305310025241 its reverse (142520013503), we get a palindrome (447830038744).
The spelling of 305310025241 in words is "three hundred five billion, three hundred ten million, twenty-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •