Base | Representation |
---|---|
bin | 100000000100010101011110… |
… | …110001111010010110001100 |
3 | 200111100212002200210111121010 |
4 | 200010111132301322112030 |
5 | 121441211030344203400 |
6 | 1215542441020005220 |
7 | 41464321314441114 |
oct | 4004253661722614 |
9 | 614325080714533 |
10 | 141035431241100 |
11 | 40a35877170a80 |
12 | 13999740690810 |
13 | 609077935c356 |
14 | 26b8219218044 |
15 | 11489c65b8450 |
hex | 80455ec7a58c |
141035431241100 has 72 divisors (see below), whose sum is σ = 445159106618688. Its totient is φ = 34190407572800.
The previous prime is 141035431241093. The next prime is 141035431241129. The reversal of 141035431241100 is 1142134530141.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 21369001434 + ... + 21369008033.
It is an arithmetic number, because the mean of its divisors is an integer number (6182765369704).
Almost surely, 2141035431241100 is an apocalyptic number.
141035431241100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
141035431241100 is an abundant number, since it is smaller than the sum of its proper divisors (304123675377588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141035431241100 is a wasteful number, since it uses less digits than its factorization.
141035431241100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42738009495 (or 42738009488 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 30.
Adding to 141035431241100 its reverse (1142134530141), we get a palindrome (142177565771241).
The spelling of 141035431241100 in words is "one hundred forty-one trillion, thirty-five billion, four hundred thirty-one million, two hundred forty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •