Base | Representation |
---|---|
bin | 1000111010110011100… |
… | …10101110110101101101 |
3 | 1002021222222010202102100 |
4 | 10131121302232311231 |
5 | 20010101440234133 |
6 | 352440352445313 |
7 | 31066044535020 |
oct | 4353162566555 |
9 | 1067888122370 |
10 | 306449149293 |
11 | 108a67612651 |
12 | 4b485249839 |
13 | 22b89c87091 |
14 | 10b9186b1b7 |
15 | 7e88967e13 |
hex | 4759caed6d |
306449149293 has 24 divisors (see below), whose sum is σ = 510893076096. Its totient is φ = 173379996000.
The previous prime is 306449149291. The next prime is 306449149309. The reversal of 306449149293 is 392941944603.
306449149293 is a `hidden beast` number, since 3 + 0 + 64 + 4 + 9 + 1 + 492 + 93 = 666.
It is not a de Polignac number, because 306449149293 - 21 = 306449149291 is a prime.
It is a super-2 number, since 2×3064491492932 (a number of 24 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (306449149291) 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 23 ways as a sum of consecutive naturals, for example, 24074193 + ... + 24086918.
It is an arithmetic number, because the mean of its divisors is an integer number (21287211504).
Almost surely, 2306449149293 is an apocalyptic number.
It is an amenable number.
306449149293 is a deficient number, since it is larger than the sum of its proper divisors (204443926803).
306449149293 is a wasteful number, since it uses less digits than its factorization.
306449149293 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48161225 (or 48161222 counting only the distinct ones).
The product of its (nonzero) digits is 5038848, while the sum is 54.
The spelling of 306449149293 in words is "three hundred six billion, four hundred forty-nine million, one hundred forty-nine thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •