Base | Representation |
---|---|
bin | 10011000111100101011011… |
… | …10101010000011100100101 |
3 | 12111212011220012010220101110 |
4 | 21203302231311100130211 |
5 | 21002304112404000423 |
6 | 225225504250015233 |
7 | 11566303230233100 |
oct | 1143625565203445 |
9 | 174764805126343 |
10 | 42042056312613 |
11 | 12439a32833005 |
12 | 4870047717519 |
13 | 1a5c719c141c6 |
14 | a54bbc68d737 |
15 | 4cd924eb9193 |
hex | 263cadd50725 |
42042056312613 has 192 divisors, whose sum is σ = 72245444935680. Its totient is φ = 21593609856000.
The previous prime is 42042056312611. The next prime is 42042056312653. The reversal of 42042056312613 is 31621365024024.
42042056312613 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 42042056312613 - 21 = 42042056312611 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42042056312611) by changing a digit.
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 191 ways as a sum of consecutive naturals, for example, 8264604556 + ... + 8264609642.
It is an arithmetic number, because the mean of its divisors is an integer number (376278359040).
Almost surely, 242042056312613 is an apocalyptic number.
It is an amenable number.
42042056312613 is a deficient number, since it is larger than the sum of its proper divisors (30203388623067).
42042056312613 is a wasteful number, since it uses less digits than its factorization.
42042056312613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7008 (or 7001 counting only the distinct ones).
The product of its (nonzero) digits is 207360, while the sum is 39.
The spelling of 42042056312613 in words is "forty-two trillion, forty-two billion, fifty-six million, three hundred twelve thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •