Base | Representation |
---|---|
bin | 10110100011001011… |
… | …11110001101100000 |
3 | 1011020201012010102001 |
4 | 23101211332031200 |
5 | 144243204430010 |
6 | 5321144333344 |
7 | 606002036434 |
oct | 132145761540 |
9 | 34221163361 |
10 | 12106326880 |
11 | 515278462a |
12 | 241a474254 |
13 | 11ac1b203b |
14 | 82bbb89c4 |
15 | 4acc74c3a |
hex | 2d197e360 |
12106326880 has 48 divisors (see below), whose sum is σ = 28945821744. Its totient is φ = 4784181760.
The previous prime is 12106326857. The next prime is 12106326887. The reversal of 12106326880 is 8862360121.
It is a happy number.
12106326880 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12106326887) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 442531 + ... + 469090.
It is an arithmetic number, because the mean of its divisors is an integer number (603037953).
Almost surely, 212106326880 is an apocalyptic number.
12106326880 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12106326880 is an abundant number, since it is smaller than the sum of its proper divisors (16839494864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12106326880 is an equidigital number, since it uses as much as digits as its factorization.
12106326880 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 911719 (or 911711 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 37.
The spelling of 12106326880 in words is "twelve billion, one hundred six million, three hundred twenty-six thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.038 sec. • engine limits •