Base | Representation |
---|---|
bin | 10110011111110000000100… |
… | …00111111001011111110000 |
3 | 20111011020100100101000112102 |
4 | 23033320002013321133300 |
5 | 22441001433022042042 |
6 | 253113543231315532 |
7 | 13264023362004503 |
oct | 1317700207713760 |
9 | 214136310330472 |
10 | 49469468940272 |
11 | 1484297a606627 |
12 | 566b62107bba8 |
13 | 217ac491a18b4 |
14 | c3049961b13a |
15 | 5abc339a1b32 |
hex | 2cfe021f97f0 |
49469468940272 has 40 divisors (see below), whose sum is σ = 100034897356800. Its totient is φ = 23654453197760.
The previous prime is 49469468940271. The next prime is 49469468940293. The reversal of 49469468940272 is 27204986496494.
It is a super-2 number, since 2×494694689402722 (a number of 28 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 49469468940272.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49469468940271) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12006272 + ... + 15591327.
It is an arithmetic number, because the mean of its divisors is an integer number (2500872433920).
Almost surely, 249469468940272 is an apocalyptic number.
It is an amenable number.
49469468940272 is an abundant number, since it is smaller than the sum of its proper divisors (50565428416528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49469468940272 is a wasteful number, since it uses less digits than its factorization.
49469468940272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27602501 (or 27602495 counting only the distinct ones).
The product of its (nonzero) digits is 1504935936, while the sum is 74.
The spelling of 49469468940272 in words is "forty-nine trillion, four hundred sixty-nine billion, four hundred sixty-eight million, nine hundred forty thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •