Base | Representation |
---|---|
bin | 1111001110101111110… |
… | …11000100110110101000 |
3 | 1212000202121220212011201 |
4 | 13213113323010312220 |
5 | 32033221242140012 |
6 | 1040223523133544 |
7 | 52544125316062 |
oct | 7472773046650 |
9 | 1760677825151 |
10 | 523313630632 |
11 | 191a329a1231 |
12 | 855088142b4 |
13 | 3a46b19aca0 |
14 | 1b485632732 |
15 | d92c745857 |
hex | 79d7ec4da8 |
523313630632 has 32 divisors (see below), whose sum is σ = 1093128611400. Its totient is φ = 233200767744.
The previous prime is 523313630561. The next prime is 523313630687. The reversal of 523313630632 is 236036313325.
It can be written as a sum of positive squares in 4 ways, for example, as 499642577316 + 23671053316 = 706854^2 + 153854^2 .
It is a junction number, because it is equal to n+sod(n) for n = 523313630591 and 523313630600.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 86753223 + ... + 86759254.
Almost surely, 2523313630632 is an apocalyptic number.
523313630632 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
523313630632 is an abundant number, since it is smaller than the sum of its proper divisors (569814980768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
523313630632 is a wasteful number, since it uses less digits than its factorization.
523313630632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173512525 (or 173512521 counting only the distinct ones).
The product of its (nonzero) digits is 174960, while the sum is 37.
Adding to 523313630632 its reverse (236036313325), we get a palindrome (759349943957).
The spelling of 523313630632 in words is "five hundred twenty-three billion, three hundred thirteen million, six hundred thirty thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •