Base | Representation |
---|---|
bin | 100111101010111001… |
… | …111110000101000010 |
3 | 11001221120110100110200 |
4 | 213222321332011002 |
5 | 1144214004130230 |
6 | 31322423110030 |
7 | 3035364035244 |
oct | 475271760502 |
9 | 131846410420 |
10 | 42595770690 |
11 | 17079224a80 |
12 | 83092a2316 |
13 | 402aaa4455 |
14 | 20c122c094 |
15 | 119482e160 |
hex | 9eae7e142 |
42595770690 has 288 divisors, whose sum is σ = 133942813056. Its totient is φ = 9294827520.
The previous prime is 42595770677. The next prime is 42595770719. The reversal of 42595770690 is 9607759524.
42595770690 is a `hidden beast` number, since 4 + 2 + 5 + 9 + 577 + 0 + 69 + 0 = 666.
It is a super-2 number, since 2×425957706902 (a number of 22 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 6577294 + ... + 6583766.
It is an arithmetic number, because the mean of its divisors is an integer number (465079212).
Almost surely, 242595770690 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 42595770690, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (66971406528).
42595770690 is an abundant number, since it is smaller than the sum of its proper divisors (91347042366).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42595770690 is a wasteful number, since it uses less digits than its factorization.
42595770690 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6554 (or 6534 counting only the distinct ones).
The product of its (nonzero) digits is 4762800, while the sum is 54.
The spelling of 42595770690 in words is "forty-two billion, five hundred ninety-five million, seven hundred seventy thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •