Base | Representation |
---|---|
bin | 101110001111011000110… |
… | …0111011001000001101110 |
3 | 211111112222100201201221210 |
4 | 1130132301213121001232 |
5 | 1313111011022233032 |
6 | 21303315542335250 |
7 | 1224102454101522 |
oct | 134366147310156 |
9 | 24445870651853 |
10 | 6355236524142 |
11 | 2030271378900 |
12 | 86782ba2a526 |
13 | 3713b0a919cc |
14 | 17d848cd1d82 |
15 | b04aaab42cc |
hex | 5c7b19d906e |
6355236524142 has 48 divisors (see below), whose sum is σ = 14268271562496. Its totient is φ = 1884854149200.
The previous prime is 6355236524123. The next prime is 6355236524159. The reversal of 6355236524142 is 2414256325536.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 6355236524091 and 6355236524100.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 93091084 + ... + 93159327.
It is an arithmetic number, because the mean of its divisors is an integer number (297255657552).
Almost surely, 26355236524142 is an apocalyptic number.
6355236524142 is an abundant number, since it is smaller than the sum of its proper divisors (7913035038354).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6355236524142 is a wasteful number, since it uses less digits than its factorization.
6355236524142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186250485 (or 186250474 counting only the distinct ones).
The product of its digits is 5184000, while the sum is 48.
The spelling of 6355236524142 in words is "six trillion, three hundred fifty-five billion, two hundred thirty-six million, five hundred twenty-four thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •