Base | Representation |
---|---|
bin | 10111100110110001… |
… | …00011010101011010 |
3 | 1012201012221000010220 |
4 | 23303120203111122 |
5 | 201423321444031 |
6 | 5453315220510 |
7 | 626024466600 |
oct | 136330432532 |
9 | 35635830126 |
10 | 12673234266 |
11 | 541378a530 |
12 | 25582a7736 |
13 | 126c7920b4 |
14 | 8831c9870 |
15 | 4e2907596 |
hex | 2f362355a |
12673234266 has 96 divisors (see below), whose sum is σ = 32200312320. Its totient is φ = 3288146400.
The previous prime is 12673234229. The next prime is 12673234303. The reversal of 12673234266 is 66243237621.
It is an interprime number because it is at equal distance from previous prime (12673234229) and next prime (12673234303).
It is a super-2 number, since 2×126732342662 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
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, 4264161 + ... + 4267131.
It is an arithmetic number, because the mean of its divisors is an integer number (335419920).
Almost surely, 212673234266 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12673234266, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16100156160).
12673234266 is an abundant number, since it is smaller than the sum of its proper divisors (19527078054).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12673234266 is a wasteful number, since it uses less digits than its factorization.
12673234266 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4320 (or 4313 counting only the distinct ones).
The product of its digits is 435456, while the sum is 42.
The spelling of 12673234266 in words is "twelve billion, six hundred seventy-three million, two hundred thirty-four thousand, two hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •