Base | Representation |
---|---|
bin | 11111111000011110001011… |
… | …010001110111111100000110 |
3 | 200101110220200020020222110112 |
4 | 133320132023101313330012 |
5 | 121334331313302443420 |
6 | 1214120123523153022 |
7 | 41351366431500200 |
oct | 3770361321677406 |
9 | 611426606228415 |
10 | 140220134031110 |
11 | 40751030146a81 |
12 | 13887727215772 |
13 | 6031918104a43 |
14 | 268a9953c3770 |
15 | 11326aa3548c5 |
hex | 7f878b477f06 |
140220134031110 has 48 divisors (see below), whose sum is σ = 306369173084256. Its totient is φ = 45985236498432.
The previous prime is 140220134031071. The next prime is 140220134031127. The reversal of 140220134031110 is 11130431022041.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a congruent number.
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, 6220935227 + ... + 6220957766.
It is an arithmetic number, because the mean of its divisors is an integer number (6382691105922).
Almost surely, 2140220134031110 is an apocalyptic number.
140220134031110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
140220134031110 is an abundant number, since it is smaller than the sum of its proper divisors (166149039053146).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140220134031110 is a wasteful number, since it uses less digits than its factorization.
140220134031110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12441893037 (or 12441893030 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 140220134031110 its reverse (11130431022041), we get a palindrome (151350565053151).
The spelling of 140220134031110 in words is "one hundred forty trillion, two hundred twenty billion, one hundred thirty-four million, thirty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •