Base | Representation |
---|---|
bin | 1111111010101011101… |
… | …1110010100110011000 |
3 | 222010211020210212220122 |
4 | 3332222323302212120 |
5 | 13440011342140440 |
6 | 325342130212412 |
7 | 25520235640325 |
oct | 3765273624630 |
9 | 863736725818 |
10 | 273450740120 |
11 | a5a738a5408 |
12 | 44bb6124108 |
13 | 1ca2b64688c |
14 | d341111b4c |
15 | 71a69b17b5 |
hex | 3faaef2998 |
273450740120 has 16 divisors (see below), whose sum is σ = 615264165360. Its totient is φ = 109380296032.
The previous prime is 273450740119. The next prime is 273450740137. The reversal of 273450740120 is 21047054372.
It is a super-2 number, since 2×2734507401202 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 3418134212 + ... + 3418134291.
It is an arithmetic number, because the mean of its divisors is an integer number (38454010335).
Almost surely, 2273450740120 is an apocalyptic number.
273450740120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
273450740120 is an abundant number, since it is smaller than the sum of its proper divisors (341813425240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
273450740120 is a wasteful number, since it uses less digits than its factorization.
273450740120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6836268514 (or 6836268510 counting only the distinct ones).
The product of its (nonzero) digits is 47040, while the sum is 35.
Adding to 273450740120 its reverse (21047054372), we get a palindrome (294497794492).
The spelling of 273450740120 in words is "two hundred seventy-three billion, four hundred fifty million, seven hundred forty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •