Base | Representation |
---|---|
bin | 10110110110100100010101… |
… | …10001000100001100100100 |
3 | 20120221011221000112200222212 |
4 | 23123102022301010030210 |
5 | 23041323024020400002 |
6 | 254514040353342552 |
7 | 13404456140442536 |
oct | 1333221261041444 |
9 | 216834830480885 |
10 | 50253445481252 |
11 | 15015403962402 |
12 | 5777555267a58 |
13 | 2206b58570370 |
14 | c5a3cb865856 |
15 | 5c231a1b7352 |
hex | 2db48ac44324 |
50253445481252 has 48 divisors (see below), whose sum is σ = 101134682880000. Its totient is φ = 21671717719680.
The previous prime is 50253445481209. The next prime is 50253445481263. The reversal of 50253445481252 is 25218454435205.
It is a self number, because there is not a number n which added to its sum of digits gives 50253445481252.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 537446252 + ... + 537539747.
It is an arithmetic number, because the mean of its divisors is an integer number (2106972560000).
Almost surely, 250253445481252 is an apocalyptic number.
50253445481252 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
50253445481252 is an abundant number, since it is smaller than the sum of its proper divisors (50881237398748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50253445481252 is a wasteful number, since it uses less digits than its factorization.
50253445481252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1074986076 (or 1074986074 counting only the distinct ones).
The product of its (nonzero) digits is 7680000, while the sum is 50.
The spelling of 50253445481252 in words is "fifty trillion, two hundred fifty-three billion, four hundred forty-five million, four hundred eighty-one thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •