Base | Representation |
---|---|
bin | 1101101011100001010… |
… | …0001011100101010011 |
3 | 211110121222121001010001 |
4 | 3122320110023211103 |
5 | 12322310224011201 |
6 | 255544505350431 |
7 | 22660012363354 |
oct | 3327024134523 |
9 | 743558531101 |
10 | 235020532051 |
11 | 90742a66278 |
12 | 3966ba98417 |
13 | 192158814a6 |
14 | b537213d2b |
15 | 61a7c0d301 |
hex | 36b850b953 |
235020532051 has 8 divisors (see below), whose sum is σ = 237532055040. Its totient is φ = 232510818048.
The previous prime is 235020532037. The next prime is 235020532063. The reversal of 235020532051 is 150235020532.
235020532051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 235020532051 - 27 = 235020531923 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (235020532951) 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 7 ways as a sum of consecutive naturals, for example, 190216 + ... + 711493.
It is an arithmetic number, because the mean of its divisors is an integer number (29691506880).
Almost surely, 2235020532051 is an apocalyptic number.
235020532051 is a deficient number, since it is larger than the sum of its proper divisors (2511522989).
235020532051 is an equidigital number, since it uses as much as digits as its factorization.
235020532051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 904493.
The product of its (nonzero) digits is 9000, while the sum is 28.
Adding to 235020532051 its reverse (150235020532), we get a palindrome (385255552583).
The spelling of 235020532051 in words is "two hundred thirty-five billion, twenty million, five hundred thirty-two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •