Base | Representation |
---|---|
bin | 1001001110011010100000… |
… | …1111100100111001000011 |
3 | 1022220200110212101121112010 |
4 | 2103212220033210321003 |
5 | 2312141324023111121 |
6 | 33323423524504003 |
7 | 2064552645120540 |
oct | 223465017447103 |
9 | 38820425347463 |
10 | 10143240441411 |
11 | 32607a6882810 |
12 | 11799b284b003 |
13 | 58767117876c |
14 | 270d14c71bc7 |
15 | 128cb03a0376 |
hex | 939a83e4e43 |
10143240441411 has 128 divisors (see below), whose sum is σ = 17386129391616. Its totient is φ = 5107498260480.
The previous prime is 10143240441403. The next prime is 10143240441419. The reversal of 10143240441411 is 11414404234101.
It is an interprime number because it is at equal distance from previous prime (10143240441403) and next prime (10143240441419).
It is not a de Polignac number, because 10143240441411 - 23 = 10143240441403 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10143240441419) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 2187455185 + ... + 2187459821.
It is an arithmetic number, because the mean of its divisors is an integer number (135829135872).
Almost surely, 210143240441411 is an apocalyptic number.
10143240441411 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10143240441411 is a deficient number, since it is larger than the sum of its proper divisors (7242888950205).
10143240441411 is a wasteful number, since it uses less digits than its factorization.
10143240441411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6601.
The product of its (nonzero) digits is 6144, while the sum is 30.
Adding to 10143240441411 its reverse (11414404234101), we get a palindrome (21557644675512).
The spelling of 10143240441411 in words is "ten trillion, one hundred forty-three billion, two hundred forty million, four hundred forty-one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •