Base | Representation |
---|---|
bin | 111001011101010010101110… |
… | …0001011111001011101111011 |
3 | 2110021111002002022012000020020 |
4 | 1302322211130023321131323 |
5 | 1012221011310202320201 |
6 | 4550523012354101523 |
7 | 211312115160643341 |
oct | 16272453413713573 |
9 | 2407432068160206 |
10 | 505403233245051 |
11 | 137045342371579 |
12 | 4882664827a8a3 |
13 | 18901421ba4b2b |
14 | 8cb390b565991 |
15 | 3d66a707d1a36 |
hex | 1cba95c2f977b |
505403233245051 has 8 divisors (see below), whose sum is σ = 674122703848464. Its totient is φ = 336809625735840.
The previous prime is 505403233245041. The next prime is 505403233245109. The reversal of 505403233245051 is 150542332304505.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 505403233245051 - 217 = 505403233113979 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 505403233244994 and 505403233245012.
It is not an unprimeable number, because it can be changed into a prime (505403233245041) 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, 31465764180 + ... + 31465780241.
It is an arithmetic number, because the mean of its divisors is an integer number (84265337981058).
Almost surely, 2505403233245051 is an apocalyptic number.
505403233245051 is a deficient number, since it is larger than the sum of its proper divisors (168719470603413).
505403233245051 is a wasteful number, since it uses less digits than its factorization.
505403233245051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62931547101.
The product of its (nonzero) digits is 1080000, while the sum is 42.
Adding to 505403233245051 its reverse (150542332304505), we get a palindrome (655945565549556).
The spelling of 505403233245051 in words is "five hundred five trillion, four hundred three billion, two hundred thirty-three million, two hundred forty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •