Base | Representation |
---|---|
bin | 110000010110000011001101… |
… | …1010001010000011111100111 |
3 | 2001202122211120100121120211020 |
4 | 1200230012123101100133213 |
5 | 421214140202113032101 |
6 | 4104225540350342223 |
7 | 155366536335445203 |
oct | 14054063321203747 |
9 | 2052584510546736 |
10 | 425243022002151 |
11 | 11354a609948371 |
12 | 3b83ab437ba973 |
13 | 153383250b3502 |
14 | 7701c2cdcdb03 |
15 | 3426830ad0136 |
hex | 182c19b4507e7 |
425243022002151 has 8 divisors (see below), whose sum is σ = 566990836251264. Its totient is φ = 283495277877240.
The previous prime is 425243022002089. The next prime is 425243022002171. The reversal of 425243022002151 is 151200220342524.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 425243022002151 - 29 = 425243022001639 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (425243022002171) 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 7 ways as a sum of consecutive naturals, for example, 1211001 + ... + 29188226.
It is an arithmetic number, because the mean of its divisors is an integer number (70873854531408).
Almost surely, 2425243022002151 is an apocalyptic number.
425243022002151 is a deficient number, since it is larger than the sum of its proper divisors (141747814249113).
425243022002151 is a wasteful number, since it uses less digits than its factorization.
425243022002151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35062101.
The product of its (nonzero) digits is 38400, while the sum is 33.
Adding to 425243022002151 its reverse (151200220342524), we get a palindrome (576443242344675).
The spelling of 425243022002151 in words is "four hundred twenty-five trillion, two hundred forty-three billion, twenty-two million, two thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •