Base | Representation |
---|---|
bin | 1101100000101101111… |
… | …1010110010101011111 |
3 | 211012010220121121200122 |
4 | 3120023133112111133 |
5 | 12300340434020221 |
6 | 254345050345155 |
7 | 22525113646103 |
oct | 3301337262537 |
9 | 735126547618 |
10 | 232121001311 |
11 | 8a495287981 |
12 | 38ba0a2b1bb |
13 | 18b72c46224 |
14 | b3400c1903 |
15 | 60883b2eab |
hex | 360b7d655f |
232121001311 has 8 divisors (see below), whose sum is σ = 240139533600. Its totient is φ = 224103426400.
The previous prime is 232121001293. The next prime is 232121001353. The reversal of 232121001311 is 113100121232.
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 232121001311 - 26 = 232121001247 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 232121001311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232121001011) 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 7 ways as a sum of consecutive naturals, for example, 272525 + ... + 733833.
It is an arithmetic number, because the mean of its divisors is an integer number (30017441700).
Almost surely, 2232121001311 is an apocalyptic number.
232121001311 is a deficient number, since it is larger than the sum of its proper divisors (8018532289).
232121001311 is a wasteful number, since it uses less digits than its factorization.
232121001311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 478689.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 232121001311 its reverse (113100121232), we get a palindrome (345221122543).
The spelling of 232121001311 in words is "two hundred thirty-two billion, one hundred twenty-one million, one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •