Base | Representation |
---|---|
bin | 100000000111000010011010… |
… | …001110001110000101010011 |
3 | 200112000121101010010000221002 |
4 | 200013002122032032011103 |
5 | 122002231314200031233 |
6 | 1220204025553252215 |
7 | 41513613544004330 |
oct | 4007023216160523 |
9 | 615017333100832 |
10 | 141221112111443 |
11 | 40aa75a0184121 |
12 | 13a0972086406b |
13 | 60a512ac04630 |
14 | 26c31d16ad987 |
15 | 114d7428bc6e8 |
hex | 80709a38e153 |
141221112111443 has 16 divisors (see below), whose sum is σ = 173815214227200. Its totient is φ = 111732418810656.
The previous prime is 141221112111383. The next prime is 141221112111463. The reversal of 141221112111443 is 344111211122141.
It is not a de Polignac number, because 141221112111443 - 226 = 141221045002579 is a prime.
It is not an unprimeable number, because it can be changed into a prime (141221112111463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17151905 + ... + 24013122.
It is an arithmetic number, because the mean of its divisors is an integer number (10863450889200).
Almost surely, 2141221112111443 is an apocalyptic number.
141221112111443 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
141221112111443 is a deficient number, since it is larger than the sum of its proper divisors (32594102115757).
141221112111443 is a wasteful number, since it uses less digits than its factorization.
141221112111443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41202746.
The product of its digits is 1536, while the sum is 29.
Adding to 141221112111443 its reverse (344111211122141), we get a palindrome (485332323233584).
The spelling of 141221112111443 in words is "one hundred forty-one trillion, two hundred twenty-one billion, one hundred twelve million, one hundred eleven thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •