Base | Representation |
---|---|
bin | 11111010111101… |
… | …01111011100010 |
3 | 200100011110202120 |
4 | 33223311323202 |
5 | 1014331320310 |
6 | 42040125110 |
7 | 6343515021 |
oct | 1753657342 |
9 | 610143676 |
10 | 263151330 |
11 | 1255a6542 |
12 | 74166796 |
13 | 42698760 |
14 | 26d408b8 |
15 | 18180b70 |
hex | faf5ee2 |
263151330 has 128 divisors (see below), whose sum is σ = 758419200. Its totient is φ = 57729024.
The previous prime is 263151299. The next prime is 263151331. The reversal of 263151330 is 33151362.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 263151330.
It is not an unprimeable number, because it can be changed into a prime (263151331) 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 63 ways as a sum of consecutive naturals, for example, 124926 + ... + 127014.
It is an arithmetic number, because the mean of its divisors is an integer number (5925150).
Almost surely, 2263151330 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 263151330, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (379209600).
263151330 is an abundant number, since it is smaller than the sum of its proper divisors (495267870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
263151330 is a wasteful number, since it uses less digits than its factorization.
263151330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2148.
The product of its (nonzero) digits is 1620, while the sum is 24.
The square root of 263151330 is about 16221.9397730358. The cubic root of 263151330 is about 640.8187194598.
The spelling of 263151330 in words is "two hundred sixty-three million, one hundred fifty-one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •