Base | Representation |
---|---|
bin | 10111100010111101… |
… | …10111110010001100 |
3 | 1012121222220102120200 |
4 | 23301132313302030 |
5 | 201342140231320 |
6 | 5450215413500 |
7 | 625156405224 |
oct | 136136676214 |
9 | 35558812520 |
10 | 12641336460 |
11 | 53a7783205 |
12 | 2549684290 |
13 | 1265ca435c |
14 | 87cc85084 |
15 | 4dec06290 |
hex | 2f17b7c8c |
12641336460 has 144 divisors (see below), whose sum is σ = 39258535680. Its totient is φ = 3291523200.
The previous prime is 12641336441. The next prime is 12641336531. The reversal of 12641336460 is 6463314621.
12641336460 is a `hidden beast` number, since 1 + 2 + 6 + 4 + 1 + 3 + 3 + 646 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1599679 + ... + 1607561.
It is an arithmetic number, because the mean of its divisors is an integer number (272628720).
Almost surely, 212641336460 is an apocalyptic number.
12641336460 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12641336460, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19629267840).
12641336460 is an abundant number, since it is smaller than the sum of its proper divisors (26617199220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12641336460 is a wasteful number, since it uses less digits than its factorization.
12641336460 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8108 (or 8103 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 36.
The spelling of 12641336460 in words is "twelve billion, six hundred forty-one million, three hundred thirty-six thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •