Base | Representation |
---|---|
bin | 10010001101100101000… |
… | …100011001000100011101 |
3 | 11102122102100121220111211 |
4 | 102031211010121010131 |
5 | 131001113432230323 |
6 | 2354540115344421 |
7 | 156264052052014 |
oct | 22154504310435 |
9 | 4378370556454 |
10 | 1251531133213 |
11 | 442853774199 |
12 | 18267b2b2111 |
13 | 9103262a6ca |
14 | 44808343a7b |
15 | 2284dbc970d |
hex | 1236511911d |
1251531133213 has 8 divisors (see below), whose sum is σ = 1280959505408. Its totient is φ = 1222117442784.
The previous prime is 1251531133183. The next prime is 1251531133247. The reversal of 1251531133213 is 3123311351521.
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 1251531133213 - 233 = 1242941198621 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1251531233213) 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, 3497856 + ... + 3839017.
It is an arithmetic number, because the mean of its divisors is an integer number (160119938176).
Almost surely, 21251531133213 is an apocalyptic number.
It is an amenable number.
1251531133213 is a deficient number, since it is larger than the sum of its proper divisors (29428372195).
1251531133213 is an equidigital number, since it uses as much as digits as its factorization.
1251531133213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7340883.
The product of its digits is 8100, while the sum is 31.
Adding to 1251531133213 its reverse (3123311351521), we get a palindrome (4374842484734).
The spelling of 1251531133213 in words is "one trillion, two hundred fifty-one billion, five hundred thirty-one million, one hundred thirty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •