Base | Representation |
---|---|
bin | 1011001100001000010100… |
… | …1000110010101010000000 |
3 | 1121120011020121200112120221 |
4 | 2303002011020302222000 |
5 | 3103033041110310422 |
6 | 42055532424312424 |
7 | 2406602206421146 |
oct | 263020510625200 |
9 | 47504217615527 |
10 | 12303020010112 |
11 | 3a13755069427 |
12 | 14684a8612714 |
13 | 6b32290ba910 |
14 | 30767dc55596 |
15 | 16506a7c73c7 |
hex | b3085232a80 |
12303020010112 has 64 divisors (see below), whose sum is σ = 26470076832360. Its totient is φ = 5662230773760.
The previous prime is 12303020010101. The next prime is 12303020010119. The reversal of 12303020010112 is 21101002030321.
It can be written as a sum of positive squares in 4 ways, for example, as 10937730586176 + 1365289423936 = 3307224^2 + 1168456^2 .
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (16).
It is not an unprimeable number, because it can be changed into a prime (12303020010119) 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, 9885189 + ... + 11059972.
Almost surely, 212303020010112 is an apocalyptic number.
It is an amenable number.
12303020010112 is an abundant number, since it is smaller than the sum of its proper divisors (14167056822248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12303020010112 is a wasteful number, since it uses less digits than its factorization.
12303020010112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20945541 (or 20945529 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 12303020010112 its reverse (21101002030321), we get a palindrome (33404022040433).
The spelling of 12303020010112 in words is "twelve trillion, three hundred three billion, twenty million, ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •