Base | Representation |
---|---|
bin | 100011110011011… |
… | …0000111000011111 |
3 | 10002201112121012101 |
4 | 1013212300320133 |
5 | 4430021002111 |
6 | 315112545531 |
7 | 41525153506 |
oct | 10746607037 |
9 | 3081477171 |
10 | 1201344031 |
11 | 567144608 |
12 | 2963b22a7 |
13 | 161b75174 |
14 | b579d83d |
15 | 70703bc1 |
hex | 479b0e1f |
1201344031 has 4 divisors (see below), whose sum is σ = 1202797512. Its totient is φ = 1199890552.
The previous prime is 1201344029. The next prime is 1201344043. The reversal of 1201344031 is 1304431021.
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 1201344031 - 21 = 1201344029 is a prime.
It is a super-2 number, since 2×12013440312 = 2886454961638657922, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201344091) 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 3 ways as a sum of consecutive naturals, for example, 725500 + ... + 727153.
It is an arithmetic number, because the mean of its divisors is an integer number (300699378).
Almost surely, 21201344031 is an apocalyptic number.
1201344031 is a deficient number, since it is larger than the sum of its proper divisors (1453481).
1201344031 is an equidigital number, since it uses as much as digits as its factorization.
1201344031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1453480.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 1201344031 is about 34660.4101389467. The cubic root of 1201344031 is about 1063.0551561734.
Adding to 1201344031 its reverse (1304431021), we get a palindrome (2505775052).
The spelling of 1201344031 in words is "one billion, two hundred one million, three hundred forty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •