Base | Representation |
---|---|
bin | 1110100101010011100… |
… | …0101000011100101100 |
3 | 212221200000121012100121 |
4 | 3221110320220130230 |
5 | 13101042223010202 |
6 | 311032023134324 |
7 | 24046264601311 |
oct | 3512470503454 |
9 | 787600535317 |
10 | 250532235052 |
11 | 97282a08330 |
12 | 4067a8a43a4 |
13 | 1a81841c388 |
14 | c1a9398d08 |
15 | 67b48ed537 |
hex | 3a54e2872c |
250532235052 has 96 divisors (see below), whose sum is σ = 523069747200. Its totient is φ = 103715136000.
The previous prime is 250532235007. The next prime is 250532235067.
250532235052 is nontrivially palindromic in base 10.
250532235052 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 250532234999 and 250532235017.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5626677 + ... + 5671027.
It is an arithmetic number, because the mean of its divisors is an integer number (5448643200).
Almost surely, 2250532235052 is an apocalyptic number.
250532235052 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
250532235052 is an abundant number, since it is smaller than the sum of its proper divisors (272537512148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
250532235052 is a wasteful number, since it uses less digits than its factorization.
250532235052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44647 (or 44645 counting only the distinct ones).
The product of its (nonzero) digits is 90000, while the sum is 34.
It can be divided in two parts, 250532 and 235052, that added together give a palindrome (485584).
The spelling of 250532235052 in words is "two hundred fifty billion, five hundred thirty-two million, two hundred thirty-five thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •