Base | Representation |
---|---|
bin | 1000111000100011100… |
… | …11111110000110111111 |
3 | 1002011212210202112211020 |
4 | 10130101303332012333 |
5 | 20000113311430211 |
6 | 352120452555223 |
7 | 31024112030460 |
oct | 4342163760677 |
9 | 1064783675736 |
10 | 305241514431 |
11 | 1084a7971707 |
12 | 4b1a8922b13 |
13 | 22a26a1b739 |
14 | 10ab9310d67 |
15 | 7e17920306 |
hex | 4711cfe1bf |
305241514431 has 16 divisors (see below), whose sum is σ = 466054654464. Its totient is φ = 174076949664.
The previous prime is 305241514399. The next prime is 305241514471. The reversal of 305241514431 is 134415142503.
It is not a de Polignac number, because 305241514431 - 25 = 305241514399 is a prime.
It is a super-2 number, since 2×3052415144312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 305241514392 and 305241514401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (305241514471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14438056 + ... + 14459181.
It is an arithmetic number, because the mean of its divisors is an integer number (29128415904).
Almost surely, 2305241514431 is an apocalyptic number.
305241514431 is a deficient number, since it is larger than the sum of its proper divisors (160813140033).
305241514431 is a wasteful number, since it uses less digits than its factorization.
305241514431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28897750.
The product of its (nonzero) digits is 28800, while the sum is 33.
Adding to 305241514431 its reverse (134415142503), we get a palindrome (439656656934).
The spelling of 305241514431 in words is "three hundred five billion, two hundred forty-one million, five hundred fourteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •