Base | Representation |
---|---|
bin | 100111110000111… |
… | …0001001001101101 |
3 | 10102222122000211222 |
4 | 1033201301021231 |
5 | 10213032032031 |
6 | 340221353125 |
7 | 45030645635 |
oct | 11741611155 |
9 | 3388560758 |
10 | 1334252141 |
11 | 625172422 |
12 | 312a087a5 |
13 | 18356b511 |
14 | c92b96c5 |
15 | 7c208e7b |
hex | 4f87126d |
1334252141 has 8 divisors (see below), whose sum is σ = 1351013664. Its totient is φ = 1317507120.
The previous prime is 1334252131. The next prime is 1334252147. The reversal of 1334252141 is 1412524331.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1334252141 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1334252141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1334252147) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 272051 + ... + 276911.
It is an arithmetic number, because the mean of its divisors is an integer number (168876708).
Almost surely, 21334252141 is an apocalyptic number.
It is an amenable number.
1334252141 is a deficient number, since it is larger than the sum of its proper divisors (16761523).
1334252141 is an equidigital number, since it uses as much as digits as its factorization.
1334252141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8251.
The product of its digits is 2880, while the sum is 26.
The square root of 1334252141 is about 36527.4162924234. The cubic root of 1334252141 is about 1100.8951779199.
Adding to 1334252141 its reverse (1412524331), we get a palindrome (2746776472).
The spelling of 1334252141 in words is "one billion, three hundred thirty-four million, two hundred fifty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •