Base | Representation |
---|---|
bin | 1110110011110000101… |
… | …0110101110000010010 |
3 | 220022200110002100222102 |
4 | 3230330022311300102 |
5 | 13132014102420132 |
6 | 312513035440402 |
7 | 24244402644365 |
oct | 3547412656022 |
9 | 808613070872 |
10 | 254412545042 |
11 | 98994281697 |
12 | 413822b6102 |
13 | 1acb62c4ca6 |
14 | c4568740dc |
15 | 69403cec62 |
hex | 3b3c2b5c12 |
254412545042 has 8 divisors (see below), whose sum is σ = 404066983356. Its totient is φ = 119723550592.
The previous prime is 254412545041. The next prime is 254412545063. The reversal of 254412545042 is 240545214452.
254412545042 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 253845676561 + 566868481 = 503831^2 + 23809^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 254412544987 and 254412545005.
It is not an unprimeable number, because it can be changed into a prime (254412545041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3741360923 + ... + 3741360990.
Almost surely, 2254412545042 is an apocalyptic number.
254412545042 is a deficient number, since it is larger than the sum of its proper divisors (149654438314).
254412545042 is a wasteful number, since it uses less digits than its factorization.
254412545042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7482721932.
The product of its (nonzero) digits is 256000, while the sum is 38.
Adding to 254412545042 its reverse (240545214452), we get a palindrome (494957759494).
The spelling of 254412545042 in words is "two hundred fifty-four billion, four hundred twelve million, five hundred forty-five thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •