Base | Representation |
---|---|
bin | 10111100101110011… |
… | …01011011110010100 |
3 | 1012200122200211110111 |
4 | 23302321223132110 |
5 | 201414234004030 |
6 | 5452425532404 |
7 | 625565631511 |
oct | 136271533624 |
9 | 35618624414 |
10 | 12665141140 |
11 | 540a161aa3 |
12 | 2555644104 |
13 | 126abba472 |
14 | 8820c0308 |
15 | 4e1d5962a |
hex | 2f2e6b794 |
12665141140 has 24 divisors (see below), whose sum is σ = 27454758912. Its totient is φ = 4902635040.
The previous prime is 12665141123. The next prime is 12665141147. The reversal of 12665141140 is 4114156621.
It is a super-2 number, since 2×126651411402 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12665141147) 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, 10213204 + ... + 10214443.
It is an arithmetic number, because the mean of its divisors is an integer number (1143948288).
Almost surely, 212665141140 is an apocalyptic number.
12665141140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12665141140 is an abundant number, since it is smaller than the sum of its proper divisors (14789617772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12665141140 is a wasteful number, since it uses less digits than its factorization.
12665141140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20427687 (or 20427685 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 31.
Adding to 12665141140 its reverse (4114156621), we get a palindrome (16779297761).
The spelling of 12665141140 in words is "twelve billion, six hundred sixty-five million, one hundred forty-one thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •