Base | Representation |
---|---|
bin | 100110111011010… |
… | …0101010101011100 |
3 | 10101000202111220101 |
4 | 1031312211111130 |
5 | 10133333414312 |
6 | 333335230444 |
7 | 44240062060 |
oct | 11566452534 |
9 | 3330674811 |
10 | 1306154332 |
11 | 61032109a |
12 | 305518424 |
13 | 17a7b12b2 |
14 | c5683aa0 |
15 | 79a08a57 |
hex | 4dda555c |
1306154332 has 12 divisors (see below), whose sum is σ = 2612308720. Its totient is φ = 559780416.
The previous prime is 1306154309. The next prime is 1306154357. The reversal of 1306154332 is 2334516031.
1306154332 is an admirable number.
It is a Harshad number since it is a multiple of its sum of digits (28), and also a Moran number because the ratio is a prime number: 46648369 = 1306154332 / (1 + 3 + 0 + 6 + 1 + 5 + 4 + 3 + 3 + 2).
It is a self number, because there is not a number n which added to its sum of digits gives 1306154332.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23324157 + ... + 23324212.
Almost surely, 21306154332 is an apocalyptic number.
It is an amenable number.
1306154332 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1306154332 is a wasteful number, since it uses less digits than its factorization.
1306154332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46648380 (or 46648378 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 28.
The square root of 1306154332 is about 36140.7572139821. The cubic root of 1306154332 is about 1093.1124273189.
The spelling of 1306154332 in words is "one billion, three hundred six million, one hundred fifty-four thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •