Base | Representation |
---|---|
bin | 1000001001111101000… |
… | …1001101111101011100 |
3 | 111101122120122112002101 |
4 | 2002133101031331130 |
5 | 4243421411410234 |
6 | 144211025534444 |
7 | 13060040141020 |
oct | 2023721157534 |
9 | 441576575071 |
10 | 140111044444 |
11 | 5446a039508 |
12 | 231a2aa4424 |
13 | 1029b8a1877 |
14 | 6ad2296380 |
15 | 39a0858814 |
hex | 209f44df5c |
140111044444 has 24 divisors (see below), whose sum is σ = 286184263680. Its totient is φ = 58769981616.
The previous prime is 140111044439. The next prime is 140111044457. The reversal of 140111044444 is 444440111041.
It is a happy number.
It is a super-2 number, since 2×1401110444442 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 53232364 + ... + 53234995.
It is an arithmetic number, because the mean of its divisors is an integer number (11924344320).
Almost surely, 2140111044444 is an apocalyptic number.
140111044444 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
140111044444 is an abundant number, since it is smaller than the sum of its proper divisors (146073219236).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140111044444 is a wasteful number, since it uses less digits than its factorization.
140111044444 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 106467417 (or 106467415 counting only the distinct ones).
The product of its (nonzero) digits is 4096, while the sum is 28.
Adding to 140111044444 its reverse (444440111041), we get a palindrome (584551155485).
The spelling of 140111044444 in words is "one hundred forty billion, one hundred eleven million, forty-four thousand, four hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •