Base | Representation |
---|---|
bin | 11111110110110001010010… |
… | …111001100111010000001100 |
3 | 200101001201220120110120212120 |
4 | 133312301102321213100030 |
5 | 121330422400322431340 |
6 | 1213550311012132540 |
7 | 41340060333050433 |
oct | 3766612271472014 |
9 | 611051816416776 |
10 | 140103224030220 |
11 | 40706497532a30 |
12 | 13868b3a307150 |
13 | 60238a6153619 |
14 | 26850645d011a |
15 | 112e6167be4d0 |
hex | 7f6c52e6740c |
140103224030220 has 96 divisors (see below), whose sum is σ = 428173062508800. Its totient is φ = 33946846805760.
The previous prime is 140103224030183. The next prime is 140103224030227. The reversal of 140103224030220 is 22030422301041.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (140103224030227) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 53633070 + ... + 56184629.
It is an arithmetic number, because the mean of its divisors is an integer number (4460136067800).
Almost surely, 2140103224030220 is an apocalyptic number.
140103224030220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
140103224030220 is an abundant number, since it is smaller than the sum of its proper divisors (288069838478580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140103224030220 is a wasteful number, since it uses less digits than its factorization.
140103224030220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109819655 (or 109819653 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 140103224030220 its reverse (22030422301041), we get a palindrome (162133646331261).
The spelling of 140103224030220 in words is "one hundred forty trillion, one hundred three billion, two hundred twenty-four million, thirty thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •