Base | Representation |
---|---|
bin | 100000000111000100001011… |
… | …010111010111001010001000 |
3 | 200112000210021101221200211001 |
4 | 200013010023113113022020 |
5 | 122002244211121131240 |
6 | 1220204542202544344 |
7 | 41514011563430026 |
oct | 4007041327271210 |
9 | 615023241850731 |
10 | 141223010333320 |
11 | 40aa8384725333 |
12 | 13a09b705080b4 |
13 | 60a5371264a46 |
14 | 26c3331833716 |
15 | 114d80437889a |
hex | 80710b5d7288 |
141223010333320 has 64 divisors (see below), whose sum is σ = 336464636503680. Its totient is φ = 53162899209216.
The previous prime is 141223010333243. The next prime is 141223010333333. The reversal of 141223010333320 is 23333010322141.
It is an unprimeable number.
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, 3959307 + ... + 17266213.
It is an arithmetic number, because the mean of its divisors is an integer number (5257259945370).
Almost surely, 2141223010333320 is an apocalyptic number.
141223010333320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
141223010333320 is an abundant number, since it is smaller than the sum of its proper divisors (195241626170360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141223010333320 is a wasteful number, since it uses less digits than its factorization.
141223010333320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13322542 (or 13322538 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 141223010333320 its reverse (23333010322141), we get a palindrome (164556020655461).
The spelling of 141223010333320 in words is "one hundred forty-one trillion, two hundred twenty-three billion, ten million, three hundred thirty-three thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •