Base | Representation |
---|---|
bin | 1010101010010010001111… |
… | …00100110101101100010100 |
3 | 10002000010211012102002200020 |
4 | 11111021013210311230110 |
5 | 11033043013334403022 |
6 | 121505343141345140 |
7 | 4636465450024236 |
oct | 525110744655424 |
9 | 102003735362606 |
10 | 23443132341012 |
11 | 75191a405532a |
12 | 27675297081b0 |
13 | 10108a7443c37 |
14 | 5b09218da256 |
15 | 2a9c2299135c |
hex | 155247935b14 |
23443132341012 has 48 divisors (see below), whose sum is σ = 56749946016960. Its totient is φ = 7523172842752.
The previous prime is 23443132341007. The next prime is 23443132341017. The reversal of 23443132341012 is 21014323134432.
It is an interprime number because it is at equal distance from previous prime (23443132341007) and next prime (23443132341017).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23443132341017) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 96947433 + ... + 97188944.
It is an arithmetic number, because the mean of its divisors is an integer number (1182290542020).
Almost surely, 223443132341012 is an apocalyptic number.
It is an amenable number.
23443132341012 is an abundant number, since it is smaller than the sum of its proper divisors (33306813675948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23443132341012 is a wasteful number, since it uses less digits than its factorization.
23443132341012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 194136760 (or 194136758 counting only the distinct ones).
The product of its (nonzero) digits is 41472, while the sum is 33.
Adding to 23443132341012 its reverse (21014323134432), we get a palindrome (44457455475444).
The spelling of 23443132341012 in words is "twenty-three trillion, four hundred forty-three billion, one hundred thirty-two million, three hundred forty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •