Base | Representation |
---|---|
bin | 100111010001010000… |
… | …000110011010001000 |
3 | 11000211120120102222111 |
4 | 213101100012122020 |
5 | 1142323313124420 |
6 | 31212010032104 |
7 | 3021616453300 |
oct | 472120063210 |
9 | 130746512874 |
10 | 42165364360 |
11 | 16978281369 |
12 | 8209118634 |
13 | 3c8c877c52 |
14 | 207ddd0600 |
15 | 116bb6145a |
hex | 9d1406688 |
42165364360 has 48 divisors (see below), whose sum is σ = 110361392460. Its totient is φ = 14456695680.
The previous prime is 42165364327. The next prime is 42165364379. The reversal of 42165364360 is 6346356124.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 40467759556 + 1697604804 = 201166^2 + 41202^2 .
It is a super-2 number, since 2×421653643602 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10754511 + ... + 10758430.
Almost surely, 242165364360 is an apocalyptic number.
42165364360 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
42165364360 is an abundant number, since it is smaller than the sum of its proper divisors (68196028100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42165364360 is a wasteful number, since it uses less digits than its factorization.
42165364360 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21512966 (or 21512955 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 40.
The spelling of 42165364360 in words is "forty-two billion, one hundred sixty-five million, three hundred sixty-four thousand, three hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •