Base | Representation |
---|---|
bin | 111001100100001011… |
… | …1010011011010100000 |
3 | 102211002100000222210221 |
4 | 1303020113103122200 |
5 | 4011133340330240 |
6 | 132442431132424 |
7 | 11634302033266 |
oct | 1631027233240 |
9 | 384070028727 |
10 | 123620636320 |
11 | 48477698845 |
12 | 1bb60374114 |
13 | b87134141c |
14 | 5daa148436 |
15 | 3337c91a4a |
hex | 1cc85d36a0 |
123620636320 has 96 divisors (see below), whose sum is σ = 309143822400. Its totient is φ = 46583801856.
The previous prime is 123620636303. The next prime is 123620636341. The reversal of 123620636320 is 23636026321.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 430572 + ... + 657748.
It is an arithmetic number, because the mean of its divisors is an integer number (3220248150).
Almost surely, 2123620636320 is an apocalyptic number.
123620636320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 123620636320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (154571911200).
123620636320 is an abundant number, since it is smaller than the sum of its proper divisors (185523186080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123620636320 is a wasteful number, since it uses less digits than its factorization.
123620636320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227390 (or 227382 counting only the distinct ones).
The product of its (nonzero) digits is 46656, while the sum is 34.
The spelling of 123620636320 in words is "one hundred twenty-three billion, six hundred twenty million, six hundred thirty-six thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •