Base | Representation |
---|---|
bin | 10110110111111011000110… |
… | …11011000110100001111001 |
3 | 20121002122011120122010010112 |
4 | 23123331203123012201321 |
5 | 23043103430143134343 |
6 | 254551303110354105 |
7 | 13411025430661145 |
oct | 1333754333064171 |
9 | 217078146563115 |
10 | 50300030052473 |
11 | 15033139711243 |
12 | 578459635b935 |
13 | 220b3708446c6 |
14 | c5c76a730225 |
15 | 5c3644ca8218 |
hex | 2dbf636c6879 |
50300030052473 has 2 divisors, whose sum is σ = 50300030052474. Its totient is φ = 50300030052472.
The previous prime is 50300030052469. The next prime is 50300030052581. The reversal of 50300030052473 is 37425003000305.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 37095505809664 + 13204524242809 = 6090608^2 + 3633803^2 .
It is a cyclic number.
It is not a de Polignac number, because 50300030052473 - 22 = 50300030052469 is a prime.
It is a super-2 number, since 2×503000300524732 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (50300030052373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25150015026236 + 25150015026237.
It is an arithmetic number, because the mean of its divisors is an integer number (25150015026237).
Almost surely, 250300030052473 is an apocalyptic number.
It is an amenable number.
50300030052473 is a deficient number, since it is larger than the sum of its proper divisors (1).
50300030052473 is an equidigital number, since it uses as much as digits as its factorization.
50300030052473 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 37800, while the sum is 32.
Adding to 50300030052473 its reverse (37425003000305), we get a palindrome (87725033052778).
The spelling of 50300030052473 in words is "fifty trillion, three hundred billion, thirty million, fifty-two thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •