Base | Representation |
---|---|
bin | 1011110101011011001100… |
… | …1000010100001100110111 |
3 | 1201001222102210112011112020 |
4 | 2331112303020110030313 |
5 | 3201144010034204033 |
6 | 43401501524124223 |
7 | 2512055630403450 |
oct | 275266310241467 |
9 | 51058383464466 |
10 | 13012461241143 |
11 | 41676101556a1 |
12 | 1561a9ab36673 |
13 | 7350ba5543a0 |
14 | 32db40dca127 |
15 | 17873d6666b3 |
hex | bd5b3214337 |
13012461241143 has 32 divisors (see below), whose sum is σ = 21850382163456. Its totient is φ = 6704094515328.
The previous prime is 13012461241123. The next prime is 13012461241151. The reversal of 13012461241143 is 34114216421031.
It is not a de Polignac number, because 13012461241143 - 25 = 13012461241111 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13012461241103) 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, 554228880 + ... + 554252357.
It is an arithmetic number, because the mean of its divisors is an integer number (682824442608).
Almost surely, 213012461241143 is an apocalyptic number.
13012461241143 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
13012461241143 is a deficient number, since it is larger than the sum of its proper divisors (8837920922313).
13012461241143 is a wasteful number, since it uses less digits than its factorization.
13012461241143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1108481303.
The product of its (nonzero) digits is 13824, while the sum is 33.
Adding to 13012461241143 its reverse (34114216421031), we get a palindrome (47126677662174).
The spelling of 13012461241143 in words is "thirteen trillion, twelve billion, four hundred sixty-one million, two hundred forty-one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •