Base | Representation |
---|---|
bin | 100000000111000010101101… |
… | …010110010100100001110111 |
3 | 200112000122012110220222011100 |
4 | 200013002231112110201313 |
5 | 122002232443322031403 |
6 | 1220204121455141143 |
7 | 41513624521352526 |
oct | 4007025526244167 |
9 | 615018173828140 |
10 | 141221433002103 |
11 | 40aa7745327013 |
12 | 13a097b02147b3 |
13 | 60a517c53806c |
14 | 26c32221604bd |
15 | 114d760b562a3 |
hex | 8070ad594877 |
141221433002103 has 24 divisors (see below), whose sum is σ = 206781935555520. Its totient is φ = 92857441132800.
The previous prime is 141221433002059. The next prime is 141221433002119. The reversal of 141221433002103 is 301200334122141.
141221433002103 is a `hidden beast` number, since 1 + 4 + 1 + 2 + 2 + 143 + 300 + 210 + 3 = 666.
It is not a de Polignac number, because 141221433002103 - 212 = 141221432998007 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141221433002173) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 159030178 + ... + 159915728.
It is an arithmetic number, because the mean of its divisors is an integer number (8615913981480).
Almost surely, 2141221433002103 is an apocalyptic number.
141221433002103 is a deficient number, since it is larger than the sum of its proper divisors (65560502553417).
141221433002103 is a wasteful number, since it uses less digits than its factorization.
141221433002103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1128359 (or 1128356 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 141221433002103 its reverse (301200334122141), we get a palindrome (442421767124244).
The spelling of 141221433002103 in words is "one hundred forty-one trillion, two hundred twenty-one billion, four hundred thirty-three million, two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •