Base | Representation |
---|---|
bin | 1011001100001000101000… |
… | …0001101011000010110000 |
3 | 1121120011110100000120201120 |
4 | 2303002022001223002300 |
5 | 3103033223104430000 |
6 | 42055544514302240 |
7 | 2406604223526165 |
oct | 263021201530260 |
9 | 47504410016646 |
10 | 12303102030000 |
11 | 3a1379739a161 |
12 | 146850bb87980 |
13 | 6b32400a74b2 |
14 | 30768aac606c |
15 | 165072ac96a0 |
hex | b308a06b0b0 |
12303102030000 has 100 divisors (see below), whose sum is σ = 39716053863288. Its totient is φ = 3280827200000.
The previous prime is 12303102029987. The next prime is 12303102030013. The reversal of 12303102030000 is 3020130321.
It is an interprime number because it is at equal distance from previous prime (12303102029987) and next prime (12303102030013).
It is a tau number, because it is divible by the number of its divisors (100).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 205021701 + ... + 205081700.
Almost surely, 212303102030000 is an apocalyptic number.
12303102030000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12303102030000 is an abundant number, since it is smaller than the sum of its proper divisors (27412951833288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12303102030000 is an equidigital number, since it uses as much as digits as its factorization.
12303102030000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 410103432 (or 410103411 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 12303102030000 its reverse (3020130321), we get a palindrome (12306122160321).
The spelling of 12303102030000 in words is "twelve trillion, three hundred three billion, one hundred two million, thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •