Base | Representation |
---|---|
bin | 10011001111111110011100… |
… | …01000111011101110011011 |
3 | 12112212202001122120010120011 |
4 | 21213333032020323232123 |
5 | 21022020034423302423 |
6 | 230010144403142351 |
7 | 11626160545020466 |
oct | 1147771610735633 |
9 | 175782048503504 |
10 | 42330361150363 |
11 | 12540229356860 |
12 | 48b7aa83749b7 |
13 | 1a80974ab1060 |
14 | a64b2c4862dd |
15 | 4d619aa6eb0d |
hex | 267fce23bb9b |
42330361150363 has 32 divisors (see below), whose sum is σ = 52658117729280. Its totient is φ = 33431180597760.
The previous prime is 42330361150351. The next prime is 42330361150367. The reversal of 42330361150363 is 36305116303324.
It is not a de Polignac number, because 42330361150363 - 213 = 42330361142171 is a prime.
It is a super-2 number, since 2×423303611503632 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (42330361150367) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 66308748 + ... + 66944086.
It is an arithmetic number, because the mean of its divisors is an integer number (1645566179040).
Almost surely, 242330361150363 is an apocalyptic number.
42330361150363 is a deficient number, since it is larger than the sum of its proper divisors (10327756578917).
42330361150363 is a wasteful number, since it uses less digits than its factorization.
42330361150363 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 662787.
The product of its (nonzero) digits is 349920, while the sum is 40.
Adding to 42330361150363 its reverse (36305116303324), we get a palindrome (78635477453687).
The spelling of 42330361150363 in words is "forty-two trillion, three hundred thirty billion, three hundred sixty-one million, one hundred fifty thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •