Base | Representation |
---|---|
bin | 100000010111101100000100… |
… | …010001000110000001101001 |
3 | 200200001222212012100221222220 |
4 | 200113230010101012001221 |
5 | 122130003220223104010 |
6 | 1222441423505104253 |
7 | 41662362103160640 |
oct | 4027540421060151 |
9 | 620058765327886 |
10 | 142365352550505 |
11 | 413a889706a847 |
12 | 13b73438628089 |
13 | 6158cc24294a6 |
14 | 272273c5a6357 |
15 | 116d3b2271970 |
hex | 817b04446069 |
142365352550505 has 32 divisors (see below), whose sum is σ = 261012090086400. Its totient is φ = 64909585524672.
The previous prime is 142365352550479. The next prime is 142365352550537. The reversal of 142365352550505 is 505055253563241.
It is not a de Polignac number, because 142365352550505 - 28 = 142365352550249 is a prime.
It is a super-3 number, since 3×1423653525505053 (a number of 43 digits) contains 333 as substring.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 1788694375 + ... + 1788773964.
It is an arithmetic number, because the mean of its divisors is an integer number (8156627815200).
Almost surely, 2142365352550505 is an apocalyptic number.
142365352550505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
142365352550505 is a deficient number, since it is larger than the sum of its proper divisors (118646737535895).
142365352550505 is a wasteful number, since it uses less digits than its factorization.
142365352550505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3577468733.
The product of its (nonzero) digits is 13500000, while the sum is 51.
The spelling of 142365352550505 in words is "one hundred forty-two trillion, three hundred sixty-five billion, three hundred fifty-two million, five hundred fifty thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •