Base | Representation |
---|---|
bin | 100110110100001… |
… | …0101111101001011 |
3 | 10100202201212011210 |
4 | 1031220111331023 |
5 | 10131404440243 |
6 | 333123224203 |
7 | 44163253500 |
oct | 11550257513 |
9 | 3322655153 |
10 | 1302421323 |
11 | 609201465 |
12 | 304218063 |
13 | 179aa5108 |
14 | c4d914a7 |
15 | 7951c933 |
hex | 4da15f4b |
1302421323 has 24 divisors (see below), whose sum is σ = 2138914512. Its totient is φ = 700460544.
The previous prime is 1302421313. The next prime is 1302421327. The reversal of 1302421323 is 3231242031.
It is not a de Polignac number, because 1302421323 - 212 = 1302417227 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 1302421323.
It is not an unprimeable number, because it can be changed into a prime (1302421327) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 258090 + ... + 263087.
It is an arithmetic number, because the mean of its divisors is an integer number (89121438).
Almost surely, 21302421323 is an apocalyptic number.
1302421323 is a deficient number, since it is larger than the sum of its proper divisors (836493189).
1302421323 is a wasteful number, since it uses less digits than its factorization.
1302421323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 521211 (or 521204 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
The square root of 1302421323 is about 36089.0748426723. The cubic root of 1302421323 is about 1092.0700563208.
Adding to 1302421323 its reverse (3231242031), we get a palindrome (4533663354).
The spelling of 1302421323 in words is "one billion, three hundred two million, four hundred twenty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •