Base | Representation |
---|---|
bin | 100000000011111111110000… |
… | …001001001101011110101100 |
3 | 200111021121212201101220200022 |
4 | 200003333300021031132230 |
5 | 121440320240130210244 |
6 | 1215524021535421312 |
7 | 41462534204300444 |
oct | 4003776011153654 |
9 | 614247781356608 |
10 | 141012100241324 |
11 | 40a26994454584 |
12 | 1399510b084838 |
13 | 608b4cb83a340 |
14 | 26b70447a7124 |
15 | 11480ad1c46ee |
hex | 803ff024d7ac |
141012100241324 has 24 divisors (see below), whose sum is σ = 265755492476880. Its totient is φ = 65082037857984.
The previous prime is 141012100241281. The next prime is 141012100241417. The reversal of 141012100241324 is 423142001210141.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a junction number, because it is equal to n+sod(n) for n = 141012100241293 and 141012100241302.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 2467679 + ... + 16973910.
It is an arithmetic number, because the mean of its divisors is an integer number (11073145519870).
Almost surely, 2141012100241324 is an apocalyptic number.
It is an amenable number.
141012100241324 is a deficient number, since it is larger than the sum of its proper divisors (124743392235556).
141012100241324 is a wasteful number, since it uses less digits than its factorization.
141012100241324 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19581089 (or 19581087 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 26.
Adding to 141012100241324 its reverse (423142001210141), we get a palindrome (564154101451465).
The spelling of 141012100241324 in words is "one hundred forty-one trillion, twelve billion, one hundred million, two hundred forty-one thousand, three hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •