Base | Representation |
---|---|
bin | 1011000010110101010111… |
… | …0110111100000100111001 |
3 | 1120222220000100210101020210 |
4 | 2300231111312330010321 |
5 | 3042424001112323001 |
6 | 41454321101141333 |
7 | 2362216421344014 |
oct | 260552566740471 |
9 | 46886010711223 |
10 | 12143313011001 |
11 | 3961a4a68a167 |
12 | 1441556b5a849 |
13 | 6a115676b103 |
14 | 2dda4d21237b |
15 | 160d1e914dd6 |
hex | b0b55dbc139 |
12143313011001 has 16 divisors (see below), whose sum is σ = 16228513162496. Its totient is φ = 8076847274496.
The previous prime is 12143313010993. The next prime is 12143313011087. The reversal of 12143313011001 is 10011031334121.
It is not a de Polignac number, because 12143313011001 - 23 = 12143313010993 is a prime.
It is a super-4 number, since 4×121433130110014 (a number of 53 digits) contains 4444 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (12143313011201) 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 15 ways as a sum of consecutive naturals, for example, 30145 + ... + 4928238.
It is an arithmetic number, because the mean of its divisors is an integer number (1014282072656).
Almost surely, 212143313011001 is an apocalyptic number.
It is an amenable number.
12143313011001 is a deficient number, since it is larger than the sum of its proper divisors (4085200151495).
12143313011001 is a wasteful number, since it uses less digits than its factorization.
12143313011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4960272.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 12143313011001 its reverse (10011031334121), we get a palindrome (22154344345122).
The spelling of 12143313011001 in words is "twelve trillion, one hundred forty-three billion, three hundred thirteen million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •