Base | Representation |
---|---|
bin | 100000000110111010001101… |
… | …110001000010101010010111 |
3 | 200111222202122220102002100100 |
4 | 200012322031301002222113 |
5 | 122002110304134420203 |
6 | 1220200012514145143 |
7 | 41513152522340151 |
oct | 4006721561025227 |
9 | 614882586362310 |
10 | 141212313201303 |
11 | 40aa389544a763 |
12 | 13a07a85b821b3 |
13 | 60a4358000726 |
14 | 26c29d8c81ad1 |
15 | 114d3ca1b2ea3 |
hex | 806e8dc42a97 |
141212313201303 has 12 divisors (see below), whose sum is σ = 212841747434160. Its totient is φ = 90048431606496.
The previous prime is 141212313201247. The next prime is 141212313201319. The reversal of 141212313201303 is 303102313212141.
141212313201303 is a `hidden beast` number, since 1 + 4 + 1 + 2 + 1 + 2 + 31 + 320 + 1 + 303 = 666.
It is not a de Polignac number, because 141212313201303 - 237 = 141074874247831 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141212313201203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 341092543758 + ... + 341092544171.
It is an arithmetic number, because the mean of its divisors is an integer number (17736812286180).
Almost surely, 2141212313201303 is an apocalyptic number.
141212313201303 is a deficient number, since it is larger than the sum of its proper divisors (71629434232857).
141212313201303 is a wasteful number, since it uses less digits than its factorization.
141212313201303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 682185087958 (or 682185087955 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 141212313201303 its reverse (303102313212141), we get a palindrome (444314626413444).
The spelling of 141212313201303 in words is "one hundred forty-one trillion, two hundred twelve billion, three hundred thirteen million, two hundred one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •