Base | Representation |
---|---|
bin | 1010101010010100100110… |
… | …01101111111101100111000 |
3 | 10002000021002122102001021220 |
4 | 11111022103031333230320 |
5 | 11033103113230433422 |
6 | 121510113114232040 |
7 | 4636542060025230 |
oct | 525122315775470 |
9 | 102007078361256 |
10 | 23444401421112 |
11 | 7519795453a61 |
12 | 2767822725620 |
13 | 1010a4a3442c9 |
14 | 5b0a0228ccc0 |
15 | 2a9c990c4e5c |
hex | 15529337fb38 |
23444401421112 has 256 divisors, whose sum is σ = 71156297318400. Its totient is φ = 6283765678080.
The previous prime is 23444401421071. The next prime is 23444401421173. The reversal of 23444401421112 is 21112410444432.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3489266089 + ... + 3489272807.
It is an arithmetic number, because the mean of its divisors is an integer number (277954286400).
Almost surely, 223444401421112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23444401421112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (35578148659200).
23444401421112 is an abundant number, since it is smaller than the sum of its proper divisors (47711895897288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23444401421112 is a wasteful number, since it uses less digits than its factorization.
23444401421112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10566 (or 10562 counting only the distinct ones).
The product of its (nonzero) digits is 24576, while the sum is 33.
Adding to 23444401421112 its reverse (21112410444432), we get a palindrome (44556811865544).
The spelling of 23444401421112 in words is "twenty-three trillion, four hundred forty-four billion, four hundred one million, four hundred twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •