Base | Representation |
---|---|
bin | 100110110010010… |
… | …0010000011111011 |
3 | 10100200212002211002 |
4 | 1031210202003323 |
5 | 10131131003311 |
6 | 333045555215 |
7 | 44151623126 |
oct | 11544420373 |
9 | 3320762732 |
10 | 1301422331 |
11 | 608689950 |
12 | 303a15b0b |
13 | 1798154b1 |
14 | c4bb13bd |
15 | 793c193b |
hex | 4d9220fb |
1301422331 has 4 divisors (see below), whose sum is σ = 1419733464. Its totient is φ = 1183111200.
The previous prime is 1301422327. The next prime is 1301422333. The reversal of 1301422331 is 1332241031.
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 1301422331 - 22 = 1301422327 is a prime.
It is a super-2 number, since 2×13014223312 = 3387400167250947122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1301422333) 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, 59155550 + ... + 59155571.
It is an arithmetic number, because the mean of its divisors is an integer number (354933366).
Almost surely, 21301422331 is an apocalyptic number.
1301422331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1301422331 is a deficient number, since it is larger than the sum of its proper divisors (118311133).
1301422331 is a wasteful number, since it uses less digits than its factorization.
1301422331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118311132.
The product of its (nonzero) digits is 432, while the sum is 20.
The square root of 1301422331 is about 36075.2315446485. The cubic root of 1301422331 is about 1091.7907692515.
Adding to 1301422331 its reverse (1332241031), we get a palindrome (2633663362).
The spelling of 1301422331 in words is "one billion, three hundred one million, four hundred twenty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •