Base | Representation |
---|---|
bin | 1010011101110011100011… |
… | …10100101111101011001101 |
3 | 10000111011001020022000210001 |
4 | 11032321301310233223031 |
5 | 11004031334133033031 |
6 | 120540351024244301 |
7 | 4563505623616360 |
oct | 516716164575315 |
9 | 100434036260701 |
10 | 23014344424141 |
11 | 73733684989a4 |
12 | 26b8401470691 |
13 | cac3218a5a75 |
14 | 597c862860d7 |
15 | 29d9c8a94861 |
hex | 14ee71d2facd |
23014344424141 has 8 divisors (see below), whose sum is σ = 26311093966080. Its totient is φ = 19719841395408.
The previous prime is 23014344424109. The next prime is 23014344424147. The reversal of 23014344424141 is 14142444341032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23014344424141 - 25 = 23014344424109 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 23014344424141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23014344424147) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 561606346 + ... + 561647323.
It is an arithmetic number, because the mean of its divisors is an integer number (3288886745760).
Almost surely, 223014344424141 is an apocalyptic number.
It is an amenable number.
23014344424141 is a deficient number, since it is larger than the sum of its proper divisors (3296749541939).
23014344424141 is a wasteful number, since it uses less digits than its factorization.
23014344424141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1123256603.
The product of its (nonzero) digits is 147456, while the sum is 37.
Adding to 23014344424141 its reverse (14142444341032), we get a palindrome (37156788765173).
The spelling of 23014344424141 in words is "twenty-three trillion, fourteen billion, three hundred forty-four million, four hundred twenty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •