Base | Representation |
---|---|
bin | 10011001111000101000100… |
… | …10101001110011000111000 |
3 | 12112202210120011101220100220 |
4 | 21213202202111032120320 |
5 | 21021014000204411320 |
6 | 225544052241500040 |
7 | 11624020364342460 |
oct | 1147424225163070 |
9 | 175683504356326 |
10 | 42299561403960 |
11 | 12529163735493 |
12 | 48b1b31641620 |
13 | 1a7aaa6b24643 |
14 | a63449b3aba0 |
15 | 4d5496b1de40 |
hex | 2678a254e638 |
42299561403960 has 128 divisors (see below), whose sum is σ = 145322439897600. Its totient is φ = 9648779696640.
The previous prime is 42299561403929. The next prime is 42299561403973. The reversal of 42299561403960 is 6930416599224.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a junction number, because it is equal to n+sod(n) for n = 42299561403894 and 42299561403903.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 50867215 + ... + 51692094.
It is an arithmetic number, because the mean of its divisors is an integer number (1135331561700).
Almost surely, 242299561403960 is an apocalyptic number.
42299561403960 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
42299561403960 is an abundant number, since it is smaller than the sum of its proper divisors (103022878493640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42299561403960 is a wasteful number, since it uses less digits than its factorization.
42299561403960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102559821 (or 102559817 counting only the distinct ones).
The product of its (nonzero) digits is 25194240, while the sum is 60.
The spelling of 42299561403960 in words is "forty-two trillion, two hundred ninety-nine billion, five hundred sixty-one million, four hundred three thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •