Base | Representation |
---|---|
bin | 1000001011101100000… |
… | …0001111000101110000 |
3 | 111102212000012201201112 |
4 | 2002323000033011300 |
5 | 4300400021322142 |
6 | 144325131052452 |
7 | 13104420204425 |
oct | 2027300170560 |
9 | 442760181645 |
10 | 140576354672 |
11 | 54688761a16 |
12 | 232b28a1128 |
13 | 103440cc170 |
14 | 6b37dbbd4c |
15 | 39cb61d382 |
hex | 20bb00f170 |
140576354672 has 20 divisors (see below), whose sum is σ = 293317971240. Its totient is φ = 64881394368.
The previous prime is 140576354663. The next prime is 140576354719. The reversal of 140576354672 is 276453675041.
It is a super-2 number, since 2×1405763546722 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 140576354672.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 337923722 + ... + 337924137.
It is an arithmetic number, because the mean of its divisors is an integer number (14665898562).
Almost surely, 2140576354672 is an apocalyptic number.
It is an amenable number.
140576354672 is an abundant number, since it is smaller than the sum of its proper divisors (152741616568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140576354672 is a wasteful number, since it uses less digits than its factorization.
140576354672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 675847880 (or 675847874 counting only the distinct ones).
The product of its (nonzero) digits is 4233600, while the sum is 50.
The spelling of 140576354672 in words is "one hundred forty billion, five hundred seventy-six million, three hundred fifty-four thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •