Base | Representation |
---|---|
bin | 111001110101001011100101… |
… | …010110101000100001100001 |
3 | 1020100112222022101211001100221 |
4 | 321311023211112220201201 |
5 | 231314124404120001040 |
6 | 2300535355055243041 |
7 | 104400456061402156 |
oct | 7165134526504141 |
9 | 1210488271731327 |
10 | 254343221250145 |
11 | 74050399755245 |
12 | 24639506219481 |
13 | abbc602b5a6c1 |
14 | 46b43c59d822d |
15 | 1e610b6a4974a |
hex | e752e55a8861 |
254343221250145 has 32 divisors (see below), whose sum is σ = 321586373750400. Its totient is φ = 192578972898816.
The previous prime is 254343221250109. The next prime is 254343221250197. The reversal of 254343221250145 is 541052122343452.
It is a cyclic number.
It is not a de Polignac number, because 254343221250145 - 29 = 254343221249633 is a prime.
It is a super-2 number, since 2×2543432212501452 (a number of 30 digits) contains 22 as substring.
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 31 ways as a sum of consecutive naturals, for example, 2227955407 + ... + 2228069563.
It is an arithmetic number, because the mean of its divisors is an integer number (10049574179700).
Almost surely, 2254343221250145 is an apocalyptic number.
It is an amenable number.
254343221250145 is a deficient number, since it is larger than the sum of its proper divisors (67243152500255).
254343221250145 is a wasteful number, since it uses less digits than its factorization.
254343221250145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136657.
The product of its (nonzero) digits is 1152000, while the sum is 43.
Adding to 254343221250145 its reverse (541052122343452), we get a palindrome (795395343593597).
The spelling of 254343221250145 in words is "two hundred fifty-four trillion, three hundred forty-three billion, two hundred twenty-one million, two hundred fifty thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •