Base | Representation |
---|---|
bin | 10011000110100011001… |
… | …010010101000001010000 |
3 | 11122111022111012012100000 |
4 | 103012203022111001100 |
5 | 133001403304402044 |
6 | 2443014104330000 |
7 | 163560663313113 |
oct | 23064312250120 |
9 | 4574274165300 |
10 | 1312702419024 |
11 | 466794325657 |
12 | 1924b1473900 |
13 | 96a30937409 |
14 | 4776c5b057a |
15 | 2422e194d69 |
hex | 131a3295050 |
1312702419024 has 120 divisors (see below), whose sum is σ = 3941181185760. Its totient is φ = 422478903168.
The previous prime is 1312702419023. The next prime is 1312702419047. The reversal of 1312702419024 is 4209142072131.
It is a super-2 number, since 2×13127024190242 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 1312702419024.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1312702419023) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5708442 + ... + 5933945.
It is an arithmetic number, because the mean of its divisors is an integer number (32843176548).
Almost surely, 21312702419024 is an apocalyptic number.
It is an amenable number.
1312702419024 is an abundant number, since it is smaller than the sum of its proper divisors (2628478766736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1312702419024 is a wasteful number, since it uses less digits than its factorization.
1312702419024 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11642439 (or 11642421 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 36.
The spelling of 1312702419024 in words is "one trillion, three hundred twelve billion, seven hundred two million, four hundred nineteen thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •