Base | Representation |
---|---|
bin | 11111111000001011101101… |
… | …101100011001000011110000 |
3 | 200101102000111200102202210002 |
4 | 133320023231230121003300 |
5 | 121334020213420010300 |
6 | 1214103044452125132 |
7 | 41350065246615224 |
oct | 3770135554310360 |
9 | 611360450382702 |
10 | 140200310313200 |
11 | 40743688180335 |
12 | 138839143067a8 |
13 | 602caa90cb947 |
14 | 2689a346a8784 |
15 | 1131de9d0a5d5 |
hex | 7f82edb190f0 |
140200310313200 has 30 divisors (see below), whose sum is σ = 336831245528424. Its totient is φ = 56080124125120.
The previous prime is 140200310313137. The next prime is 140200310313227. The reversal of 140200310313200 is 2313013002041.
It is a super-2 number, since 2×1402003103132002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 175250387492 + ... + 175250388291.
Almost surely, 2140200310313200 is an apocalyptic number.
140200310313200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
140200310313200 is an abundant number, since it is smaller than the sum of its proper divisors (196630935215224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140200310313200 is a wasteful number, since it uses less digits than its factorization.
140200310313200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 350500775801 (or 350500775790 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 140200310313200 its reverse (2313013002041), we get a palindrome (142513323315241).
The spelling of 140200310313200 in words is "one hundred forty trillion, two hundred billion, three hundred ten million, three hundred thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •