Base | Representation |
---|---|
bin | 10110111101110111… |
… | …01000110101110000 |
3 | 1011211022021111120121 |
4 | 23132323220311300 |
5 | 200223002012240 |
6 | 5355301020024 |
7 | 614360131333 |
oct | 133673506560 |
9 | 34738244517 |
10 | 12330110320 |
11 | 5258031420 |
12 | 24813b4614 |
13 | 1216675888 |
14 | 84d7cc61a |
15 | 4c272b04a |
hex | 2deee8d70 |
12330110320 has 40 divisors (see below), whose sum is σ = 31273645680. Its totient is φ = 4483676160.
The previous prime is 12330110311. The next prime is 12330110347. The reversal of 12330110320 is 2301103321.
It is a tau number, because it is divible by the number of its divisors (40).
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a junction number, because it is equal to n+sod(n) for n = 12330110294 and 12330110303.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7004865 + ... + 7006624.
It is an arithmetic number, because the mean of its divisors is an integer number (781841142).
Almost surely, 212330110320 is an apocalyptic number.
12330110320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12330110320 is an abundant number, since it is smaller than the sum of its proper divisors (18943535360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12330110320 is a wasteful number, since it uses less digits than its factorization.
12330110320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14011513 (or 14011507 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 12330110320 its reverse (2301103321), we get a palindrome (14631213641).
The spelling of 12330110320 in words is "twelve billion, three hundred thirty million, one hundred ten thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •