Base | Representation |
---|---|
bin | 1000110110010001000… |
… | …11011011011010001111 |
3 | 1002001201011001011100121 |
4 | 10123020203123122033 |
5 | 14440104141104411 |
6 | 351354505405411 |
7 | 30651466053622 |
oct | 4331043333217 |
9 | 1061634034317 |
10 | 304012441231 |
11 | 107a27108834 |
12 | 4ab05199867 |
13 | 2288c1b80a5 |
14 | 109dddb3db9 |
15 | 7d94a90571 |
hex | 46c88db68f |
304012441231 has 4 divisors (see below), whose sum is σ = 311427378864. Its totient is φ = 296597503600.
The previous prime is 304012441217. The next prime is 304012441261. The reversal of 304012441231 is 132144210403.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 304012441231 - 211 = 304012439183 is a prime.
It is a super-2 number, since 2×3040124412312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 304012441196 and 304012441205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (304012441261) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3707468755 + ... + 3707468836.
It is an arithmetic number, because the mean of its divisors is an integer number (77856844716).
Almost surely, 2304012441231 is an apocalyptic number.
304012441231 is a deficient number, since it is larger than the sum of its proper divisors (7414937633).
304012441231 is an equidigital number, since it uses as much as digits as its factorization.
304012441231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7414937632.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 304012441231 its reverse (132144210403), we get a palindrome (436156651634).
The spelling of 304012441231 in words is "three hundred four billion, twelve million, four hundred forty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •