Base | Representation |
---|---|
bin | 10011001101101010011001… |
… | …10111000111011010000001 |
3 | 12112121010220200000222112010 |
4 | 21212311030313013122001 |
5 | 21014214301444314200 |
6 | 225505442042323133 |
7 | 11620345156163115 |
oct | 1146651467073201 |
9 | 175533820028463 |
10 | 42250882807425 |
11 | 1250a553959416 |
12 | 48a46071b94a9 |
13 | 1a76319a74a76 |
14 | a60d4cadd745 |
15 | 4d4098296150 |
hex | 266d4cdc7681 |
42250882807425 has 24 divisors (see below), whose sum is σ = 73531360958560. Its totient is φ = 21347814470400.
The previous prime is 42250882807391. The next prime is 42250882807439. The reversal of 42250882807425 is 52470828805224.
42250882807425 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 42250882807425 - 210 = 42250882806401 is a prime.
It is a super-2 number, since 2×422508828074252 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 14824869736 + ... + 14824872585.
Almost surely, 242250882807425 is an apocalyptic number.
It is an amenable number.
42250882807425 is a deficient number, since it is larger than the sum of its proper divisors (31280478151135).
42250882807425 is a wasteful number, since it uses less digits than its factorization.
42250882807425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29649742353 (or 29649742348 counting only the distinct ones).
The product of its (nonzero) digits is 22937600, while the sum is 57.
The spelling of 42250882807425 in words is "forty-two trillion, two hundred fifty billion, eight hundred eighty-two million, eight hundred seven thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •