Base | Representation |
---|---|
bin | 1010100110011100101111… |
… | …00111100000001001111100 |
3 | 10001112112121202100221200110 |
4 | 11103032113213200021330 |
5 | 11023413101243332312 |
6 | 121325024442230020 |
7 | 4624121343045315 |
oct | 523162747401174 |
9 | 101475552327613 |
10 | 23311331230332 |
11 | 7478309833082 |
12 | 2745a857b5310 |
13 | 1001331380952 |
14 | 5a83bb14960c |
15 | 2a65ab95543c |
hex | 1533979e027c |
23311331230332 has 12 divisors (see below), whose sum is σ = 54393106204136. Its totient is φ = 7770443743440.
The previous prime is 23311331230309. The next prime is 23311331230379. The reversal of 23311331230332 is 23303213311332.
It is a tau number, because it is divible by the number of its divisors (12).
It is a self number, because there is not a number n which added to its sum of digits gives 23311331230332.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 971305467919 + ... + 971305467942.
Almost surely, 223311331230332 is an apocalyptic number.
It is an amenable number.
23311331230332 is an abundant number, since it is smaller than the sum of its proper divisors (31081774973804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23311331230332 is a wasteful number, since it uses less digits than its factorization.
23311331230332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1942610935868 (or 1942610935866 counting only the distinct ones).
The product of its (nonzero) digits is 17496, while the sum is 30.
Adding to 23311331230332 its reverse (23303213311332), we get a palindrome (46614544541664).
The spelling of 23311331230332 in words is "twenty-three trillion, three hundred eleven billion, three hundred thirty-one million, two hundred thirty thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •