Base | Representation |
---|---|
bin | 100000011011101110110000… |
… | …100100111101011011000001 |
3 | 200201001112211101100210122022 |
4 | 200123232300210331123001 |
5 | 122144031103031034431 |
6 | 1223213202330251225 |
7 | 42021424344034565 |
oct | 4033566044753301 |
9 | 621045741323568 |
10 | 142643121346241 |
11 | 414a567633525a |
12 | 13bb9238886b15 |
13 | 617925b544959 |
14 | 2731d6cd816a5 |
15 | 117571cd8207b |
hex | 81bbb093d6c1 |
142643121346241 has 32 divisors (see below), whose sum is σ = 145132232813568. Its totient is φ = 140177827238400.
The previous prime is 142643121346217. The next prime is 142643121346277.
142643121346241 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 142643121346241 - 242 = 138245074835137 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 142643121346192 and 142643121346201.
It is not an unprimeable number, because it can be changed into a prime (142643121346741) 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 31 ways as a sum of consecutive naturals, for example, 62371280600 + ... + 62371282886.
It is an arithmetic number, because the mean of its divisors is an integer number (4535382275424).
Almost surely, 2142643121346241 is an apocalyptic number.
It is an amenable number.
142643121346241 is a deficient number, since it is larger than the sum of its proper divisors (2489111467327).
142643121346241 is a wasteful number, since it uses less digits than its factorization.
142643121346241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6401.
The product of its digits is 663552, while the sum is 44.
The spelling of 142643121346241 in words is "one hundred forty-two trillion, six hundred forty-three billion, one hundred twenty-one million, three hundred forty-six thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •