Base | Representation |
---|---|
bin | 10011010010000010100000… |
… | …10000100011000011000011 |
3 | 12120010112001222010212121221 |
4 | 21221001100100203003003 |
5 | 21024200241444130001 |
6 | 230102512134055511 |
7 | 11634250561304305 |
oct | 1151012020430303 |
9 | 176115058125557 |
10 | 42401263661251 |
11 | 12568302a356a0 |
12 | 49097954aa597 |
13 | 1a875641c0c01 |
14 | a68336cad975 |
15 | 4d7e4a5061a1 |
hex | 2690504230c3 |
42401263661251 has 8 divisors (see below), whose sum is σ = 46256041070064. Its totient is φ = 38546505765120.
The previous prime is 42401263661243. The next prime is 42401263661303. The reversal of 42401263661251 is 15216636210424.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 42401263661251 - 23 = 42401263661243 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 42401263661198 and 42401263661207.
It is not an unprimeable number, because it can be changed into a prime (42401263661651) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 133990 + ... + 9209803.
It is an arithmetic number, because the mean of its divisors is an integer number (5782005133758).
Almost surely, 242401263661251 is an apocalyptic number.
42401263661251 is a deficient number, since it is larger than the sum of its proper divisors (3854777408813).
42401263661251 is a wasteful number, since it uses less digits than its factorization.
42401263661251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9756341.
The product of its (nonzero) digits is 414720, while the sum is 43.
Adding to 42401263661251 its reverse (15216636210424), we get a palindrome (57617899871675).
The spelling of 42401263661251 in words is "forty-two trillion, four hundred one billion, two hundred sixty-three million, six hundred sixty-one thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •