Base | Representation |
---|---|
bin | 11111111011011010001110… |
… | …000000010001000101110100 |
3 | 200102012012211122000000011220 |
4 | 133323122032000101011310 |
5 | 121401133321030210400 |
6 | 1214352555053430340 |
7 | 41402105064263541 |
oct | 3773321600210564 |
9 | 612165748000156 |
10 | 140422043210100 |
11 | 40819721662653 |
12 | 138ba89619b3b0 |
13 | 6047984b1c712 |
14 | 269666ac7bbc8 |
15 | 1137a761eb7a0 |
hex | 7fb68e011174 |
140422043210100 has 72 divisors (see below), whose sum is σ = 406735725976608. Its totient is φ = 37404592694400.
The previous prime is 140422043210069. The next prime is 140422043210101. The reversal of 140422043210100 is 1012340224041.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140422043210101) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 257761791 + ... + 258305990.
Almost surely, 2140422043210100 is an apocalyptic number.
140422043210100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
140422043210100 is an abundant number, since it is smaller than the sum of its proper divisors (266313682766508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140422043210100 is a wasteful number, since it uses less digits than its factorization.
140422043210100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 516068705 (or 516068698 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 140422043210100 its reverse (1012340224041), we get a palindrome (141434383434141).
The spelling of 140422043210100 in words is "one hundred forty trillion, four hundred twenty-two billion, forty-three million, two hundred ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •