Base | Representation |
---|---|
bin | 10100101101101001010… |
… | …000010000001011101001 |
3 | 12001002001012022011020001 |
4 | 110231221100100023221 |
5 | 141310110402340431 |
6 | 3005522334503001 |
7 | 204560115511321 |
oct | 24555120201351 |
9 | 5032035264201 |
10 | 1423400043241 |
11 | 4a972a242100 |
12 | 1aba45964a61 |
13 | a42c28211c7 |
14 | 4cc702b0281 |
15 | 2705c640e61 |
hex | 14b694102e9 |
1423400043241 has 48 divisors (see below), whose sum is σ = 1638859622400. Its totient is φ = 1234104490080.
The previous prime is 1423400043229. The next prime is 1423400043281.
1423400043241 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 1423400043241 - 213 = 1423400035049 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1423400043281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 107346870 + ... + 107360128.
It is an arithmetic number, because the mean of its divisors is an integer number (34142908800).
Almost surely, 21423400043241 is an apocalyptic number.
1423400043241 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1423400043241 is a deficient number, since it is larger than the sum of its proper divisors (215459579159).
1423400043241 is a wasteful number, since it uses less digits than its factorization.
1423400043241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13810 (or 13799 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 28.
It can be divided in two parts, 14234000 and 43241, that added together give a palindrome (14277241).
The spelling of 1423400043241 in words is "one trillion, four hundred twenty-three billion, four hundred million, forty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •