Base | Representation |
---|---|
bin | 10011000101000000111… |
… | …011011011010000100010 |
3 | 11122100001122001101010121 |
4 | 103011000323123100202 |
5 | 132440014403022000 |
6 | 2442142352350454 |
7 | 163502102030236 |
oct | 23050073332042 |
9 | 4570048041117 |
10 | 1311054345250 |
11 | 466018aa9411 |
12 | 19211154542a |
13 | 9682a36bc30 |
14 | 476537645c6 |
15 | 2418464bb1a |
hex | 13140edb422 |
1311054345250 has 96 divisors (see below), whose sum is σ = 2709134679888. Its totient is φ = 472272768000.
The previous prime is 1311054345233. The next prime is 1311054345257. The reversal of 1311054345250 is 525434501131.
It can be written as a sum of positive squares in 24 ways, for example, as 1246078805841 + 64975539409 = 1116279^2 + 254903^2 .
It is not an unprimeable number, because it can be changed into a prime (1311054345257) 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 47 ways as a sum of consecutive naturals, for example, 5343262 + ... + 5583238.
Almost surely, 21311054345250 is an apocalyptic number.
1311054345250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1311054345250 is an abundant number, since it is smaller than the sum of its proper divisors (1398080334638).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1311054345250 is a wasteful number, since it uses less digits than its factorization.
1311054345250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 240089 (or 240038 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 34.
Adding to 1311054345250 its reverse (525434501131), we get a palindrome (1836488846381).
The spelling of 1311054345250 in words is "one trillion, three hundred eleven billion, fifty-four million, three hundred forty-five thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •