Base | Representation |
---|---|
bin | 100111001110110111… |
… | …101100101110110110 |
3 | 11000201210101201102200 |
4 | 213032313230232312 |
5 | 1142233101211202 |
6 | 31204021445330 |
7 | 3020623051020 |
oct | 471667545666 |
9 | 130653351380 |
10 | 42125413302 |
11 | 16957774565 |
12 | 81b7870846 |
13 | 3c844ca77b |
14 | 2078991010 |
15 | 11683bde1c |
hex | 9cedecbb6 |
42125413302 has 24 divisors (see below), whose sum is σ = 104310547536. Its totient is φ = 12035832336.
The previous prime is 42125413301. The next prime is 42125413417. The reversal of 42125413302 is 20331452124.
42125413302 is a `hidden beast` number, since 4 + 212 + 5 + 413 + 30 + 2 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42125413301) 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 11 ways as a sum of consecutive naturals, for example, 167164213 + ... + 167164464.
It is an arithmetic number, because the mean of its divisors is an integer number (4346272814).
Almost surely, 242125413302 is an apocalyptic number.
42125413302 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
42125413302 is an abundant number, since it is smaller than the sum of its proper divisors (62185134234).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42125413302 is a wasteful number, since it uses less digits than its factorization.
42125413302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 334328692 (or 334328689 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
Adding to 42125413302 its reverse (20331452124), we get a palindrome (62456865426).
The spelling of 42125413302 in words is "forty-two billion, one hundred twenty-five million, four hundred thirteen thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.905 sec. • engine limits •