Base | Representation |
---|---|
bin | 1001001110010011110010… |
… | …1001001010110101111100 |
3 | 1022220111211001112102010102 |
4 | 2103210330221022311330 |
5 | 2312124124403224012 |
6 | 33322524440300232 |
7 | 2064460134660521 |
oct | 223447451126574 |
9 | 38814731472112 |
10 | 10141435211132 |
11 | 325aa5a876565 |
12 | 117958a171678 |
13 | 587444176b74 |
14 | 270bc31d7148 |
15 | 128c06b622c2 |
hex | 9393ca4ad7c |
10141435211132 has 12 divisors (see below), whose sum is σ = 17747536565136. Its totient is φ = 5070710478240.
The previous prime is 10141435211101. The next prime is 10141435211179. The reversal of 10141435211132 is 23111253414101.
It is a junction number, because it is equal to n+sod(n) for n = 10141435211095 and 10141435211104.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 2637632 + ... + 5219192.
It is an arithmetic number, because the mean of its divisors is an integer number (1478961380428).
Almost surely, 210141435211132 is an apocalyptic number.
It is an amenable number.
10141435211132 is a deficient number, since it is larger than the sum of its proper divisors (7606101354004).
10141435211132 is a wasteful number, since it uses less digits than its factorization.
10141435211132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3563668 (or 3563666 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 29.
Adding to 10141435211132 its reverse (23111253414101), we get a palindrome (33252688625233).
The spelling of 10141435211132 in words is "ten trillion, one hundred forty-one billion, four hundred thirty-five million, two hundred eleven thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •