Base | Representation |
---|---|
bin | 10110010011010010100011… |
… | …10010001101011100100100 |
3 | 20102122022012010100100111021 |
4 | 23021221101302031130210 |
5 | 22411443100011440000 |
6 | 252145133255420524 |
7 | 13221055230020062 |
oct | 1311512162153444 |
9 | 212568163310437 |
10 | 49041308702500 |
11 | 14698336292854 |
12 | 560064b084744 |
13 | 21497636a0a8a |
14 | c1787d4b7032 |
15 | 5a0a24c3e11a |
hex | 2c9a51c8d724 |
49041308702500 has 135 divisors (see below), whose sum is σ = 107892920083333. Its totient is φ = 19498453744000.
The previous prime is 49041308702471. The next prime is 49041308702549. The reversal of 49041308702500 is 520780314094.
The square root of 49041308702500 is 7002950.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 7 ways, for example, as 48420137737764 + 621170964736 = 6958458^2 + 788144^2 .
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 79483482192 + ... + 79483482808.
Almost surely, 249041308702500 is an apocalyptic number.
49041308702500 is the 7002950-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 49041308702500
49041308702500 is an abundant number, since it is smaller than the sum of its proper divisors (58851611380833).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49041308702500 is an frugal number, since it uses more digits than its factorization.
49041308702500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1712 (or 851 counting only the distinct ones).
The product of its (nonzero) digits is 241920, while the sum is 43.
The spelling of 49041308702500 in words is "forty-nine trillion, forty-one billion, three hundred eight million, seven hundred two thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •