Base | Representation |
---|---|
bin | 10100111001001011110… |
… | …100000110101111000110 |
3 | 12002021000202010100122201 |
4 | 110321023310012233012 |
5 | 142011000000332032 |
6 | 3015332052345114 |
7 | 205506145235653 |
oct | 24711364065706 |
9 | 5067022110581 |
10 | 1435791027142 |
11 | 503a0867076a |
12 | 1b232361519a |
13 | a551898b544 |
14 | 4d6c7bc6c2a |
15 | 275353938e7 |
hex | 14e4bd06bc6 |
1435791027142 has 32 divisors (see below), whose sum is σ = 2252915804160. Its totient is φ = 685794844320.
The previous prime is 1435791027137. The next prime is 1435791027149. The reversal of 1435791027142 is 2417201975341.
It is a super-2 number, since 2×14357910271422 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1435791027092 and 1435791027101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1435791027149) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 604198 + ... + 1799065.
It is an arithmetic number, because the mean of its divisors is an integer number (70403618880).
Almost surely, 21435791027142 is an apocalyptic number.
1435791027142 is a deficient number, since it is larger than the sum of its proper divisors (817124777018).
1435791027142 is a wasteful number, since it uses less digits than its factorization.
1435791027142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2403468.
The product of its (nonzero) digits is 423360, while the sum is 46.
The spelling of 1435791027142 in words is "one trillion, four hundred thirty-five billion, seven hundred ninety-one million, twenty-seven thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •