Base | Representation |
---|---|
bin | 11111110110110000010111… |
… | …001000010001011100100100 |
3 | 200101001122022200112120102202 |
4 | 133312300113020101130210 |
5 | 121330413322114140400 |
6 | 1213550023310554032 |
7 | 41340023435346200 |
oct | 3766602710213444 |
9 | 611048280476382 |
10 | 140102221240100 |
11 | 40706022483969 |
12 | 138688ba508918 |
13 | 602377647a4a2 |
14 | 2684dab357b00 |
15 | 112e5a873b4d5 |
hex | 7f6c17211724 |
140102221240100 has 108 divisors (see below), whose sum is σ = 372271616685360. Its totient is φ = 45506886868800.
The previous prime is 140102221240097. The next prime is 140102221240117. The reversal of 140102221240100 is 1042122201041.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
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 35 ways as a sum of consecutive naturals, for example, 752335586 + ... + 752521785.
Almost surely, 2140102221240100 is an apocalyptic number.
140102221240100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
140102221240100 is an abundant number, since it is smaller than the sum of its proper divisors (232169395445260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140102221240100 is a wasteful number, since it uses less digits than its factorization.
140102221240100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1504857418 (or 1504857404 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 140102221240100 its reverse (1042122201041), we get a palindrome (141144343441141).
The spelling of 140102221240100 in words is "one hundred forty trillion, one hundred two billion, two hundred twenty-one million, two hundred forty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •