Base | Representation |
---|---|
bin | 1011111101000011011111… |
… | …0000001100000110110111 |
3 | 1201112111202120111111222012 |
4 | 2333100313300030012313 |
5 | 3210320430014231033 |
6 | 43542020132154435 |
7 | 2524406025512645 |
oct | 277206760140667 |
9 | 51474676444865 |
10 | 13143535305143 |
11 | 4208162034a21 |
12 | 158337b468a1b |
13 | 744578ac8639 |
14 | 336216da2195 |
15 | 17bd6093b248 |
hex | bf437c0c1b7 |
13143535305143 has 4 divisors (see below), whose sum is σ = 13143549132048. Its totient is φ = 13143521478240.
The previous prime is 13143535305139. The next prime is 13143535305161. The reversal of 13143535305143 is 34150353534131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13143535305143 - 22 = 13143535305139 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13143535305143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13143535305163) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5373203 + ... + 7426868.
It is an arithmetic number, because the mean of its divisors is an integer number (3285887283012).
Almost surely, 213143535305143 is an apocalyptic number.
13143535305143 is a deficient number, since it is larger than the sum of its proper divisors (13826905).
13143535305143 is a wasteful number, since it uses less digits than its factorization.
13143535305143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13826904.
The product of its (nonzero) digits is 486000, while the sum is 41.
Adding to 13143535305143 its reverse (34150353534131), we get a palindrome (47293888839274).
The spelling of 13143535305143 in words is "thirteen trillion, one hundred forty-three billion, five hundred thirty-five million, three hundred five thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •