Base | Representation |
---|---|
bin | 1011100011010100011110… |
… | …0001101011011001010100 |
3 | 1122222020120200100212101012 |
4 | 2320311013201223121110 |
5 | 3131100001041230413 |
6 | 43002541230351352 |
7 | 2450434662151241 |
oct | 270650741533124 |
9 | 48866520325335 |
10 | 12701418305108 |
11 | 4057706565085 |
12 | 151175335b558 |
13 | 71197a947100 |
14 | 31ca753dc5c8 |
15 | 1705d67867a8 |
hex | b8d4786b654 |
12701418305108 has 72 divisors (see below), whose sum is σ = 24238073760768. Its totient is φ = 5821102929408.
The previous prime is 12701418305101. The next prime is 12701418305119. The reversal of 12701418305108 is 80150381410721.
12701418305108 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×127014183051082 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12701418305101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 58664060 + ... + 58880172.
It is an arithmetic number, because the mean of its divisors is an integer number (336639913344).
Almost surely, 212701418305108 is an apocalyptic number.
It is an amenable number.
12701418305108 is a deficient number, since it is larger than the sum of its proper divisors (11536655455660).
12701418305108 is a wasteful number, since it uses less digits than its factorization.
12701418305108 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 216753 (or 216738 counting only the distinct ones).
The product of its (nonzero) digits is 53760, while the sum is 41.
Adding to 12701418305108 its reverse (80150381410721), we get a palindrome (92851799715829).
The spelling of 12701418305108 in words is "twelve trillion, seven hundred one billion, four hundred eighteen million, three hundred five thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •