Base | Representation |
---|---|
bin | 100111110000011… |
… | …0110110001100111 |
3 | 10102222011212212001 |
4 | 1033200312301213 |
5 | 10213001404111 |
6 | 340212310131 |
7 | 45025631551 |
oct | 11740666147 |
9 | 3388155761 |
10 | 1334013031 |
11 | 62501980a |
12 | 312912347 |
13 | 1834b6730 |
14 | c92564d1 |
15 | 7c1ad1c1 |
hex | 4f836c67 |
1334013031 has 8 divisors (see below), whose sum is σ = 1441165824. Its totient is φ = 1227508320.
The previous prime is 1334013029. The next prime is 1334013077. The reversal of 1334013031 is 1303104331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1334013031 - 21 = 1334013029 is a prime.
It is a super-2 number, since 2×13340130312 = 3559181533755613922, 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 (1334013091) 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 7 ways as a sum of consecutive naturals, for example, 157735 + ... + 165976.
It is an arithmetic number, because the mean of its divisors is an integer number (180145728).
Almost surely, 21334013031 is an apocalyptic number.
1334013031 is a deficient number, since it is larger than the sum of its proper divisors (107152793).
1334013031 is a wasteful number, since it uses less digits than its factorization.
1334013031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 324041.
The product of its (nonzero) digits is 324, while the sum is 19.
The square root of 1334013031 is about 36524.1431247880. The cubic root of 1334013031 is about 1100.8294105475.
Adding to 1334013031 its reverse (1303104331), we get a palindrome (2637117362).
The spelling of 1334013031 in words is "one billion, three hundred thirty-four million, thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •