Base | Representation |
---|---|
bin | 1110100101010011100… |
… | …0101000011100101011 |
3 | 212221200000121012100120 |
4 | 3221110320220130223 |
5 | 13101042223010201 |
6 | 311032023134323 |
7 | 24046264601310 |
oct | 3512470503453 |
9 | 787600535316 |
10 | 250532235051 |
11 | 97282a0832a |
12 | 4067a8a43a3 |
13 | 1a81841c387 |
14 | c1a9398d07 |
15 | 67b48ed536 |
hex | 3a54e2872b |
250532235051 has 32 divisors (see below), whose sum is σ = 384546129408. Its totient is φ = 142119774720.
The previous prime is 250532235007. The next prime is 250532235067. The reversal of 250532235051 is 150532235052.
250532235051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 250532235051 - 210 = 250532234027 is a prime.
It is not an unprimeable number, because it can be changed into a prime (250532235001) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 2974125 + ... + 3057201.
It is an arithmetic number, because the mean of its divisors is an integer number (12017066544).
Almost surely, 2250532235051 is an apocalyptic number.
250532235051 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
250532235051 is a deficient number, since it is larger than the sum of its proper divisors (134013894357).
250532235051 is a wasteful number, since it uses less digits than its factorization.
250532235051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84131.
The product of its (nonzero) digits is 45000, while the sum is 33.
Subtracting from 250532235051 its reverse (150532235052), we obtain a palindrome (99999999999).
The spelling of 250532235051 in words is "two hundred fifty billion, five hundred thirty-two million, two hundred thirty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •