Base | Representation |
---|---|
bin | 111100000110100010011010… |
… | …001100011111110100000011 |
3 | 1021122220220020100100000120122 |
4 | 330012202122030133310003 |
5 | 234121304021340413243 |
6 | 2334104245212330455 |
7 | 106451234502005300 |
oct | 7406423214376403 |
9 | 1248826210300518 |
10 | 264332054232323 |
11 | 7725165a545510 |
12 | 257913a6173a2b |
13 | b4655375b176c |
14 | 493ba4d9bc0a7 |
15 | 2085d3b40b668 |
hex | f0689a31fd03 |
264332054232323 has 48 divisors (see below), whose sum is σ = 351289853316864. Its totient is φ = 196306422459840.
The previous prime is 264332054232283. The next prime is 264332054232349. The reversal of 264332054232323 is 323232450233462.
It is not a de Polignac number, because 264332054232323 - 28 = 264332054232067 is a prime.
It is not an unprimeable number, because it can be changed into a prime (264332054232023) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 35053865 + ... + 41921802.
It is an arithmetic number, because the mean of its divisors is an integer number (7318538610768).
Almost surely, 2264332054232323 is an apocalyptic number.
264332054232323 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
264332054232323 is a deficient number, since it is larger than the sum of its proper divisors (86957799084541).
264332054232323 is a wasteful number, since it uses less digits than its factorization.
264332054232323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76975992 (or 76975985 counting only the distinct ones).
The product of its (nonzero) digits is 3732480, while the sum is 44.
The spelling of 264332054232323 in words is "two hundred sixty-four trillion, three hundred thirty-two billion, fifty-four million, two hundred thirty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •