Base | Representation |
---|---|
bin | 111001100101000010… |
… | …1000110101011001100 |
3 | 102211011100012100120102 |
4 | 1303022011012223030 |
5 | 4011213222414410 |
6 | 132445340110232 |
7 | 11635101504542 |
oct | 1631205065314 |
9 | 384140170512 |
10 | 123649419980 |
11 | 48491968399 |
12 | 1bb69b35378 |
13 | b8772ab888 |
14 | 5dadcbbd92 |
15 | 333a57a2a5 |
hex | 1cca146acc |
123649419980 has 24 divisors (see below), whose sum is σ = 259808035200. Its totient is φ = 49432291200.
The previous prime is 123649419973. The next prime is 123649419991. The reversal of 123649419980 is 89914946321.
It is a super-2 number, since 2×1236494199802 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (56) coincides with the sum of the digits of its prime factors.
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 7 ways as a sum of consecutive naturals, for example, 1680380 + ... + 1752419.
It is an arithmetic number, because the mean of its divisors is an integer number (10825334800).
Almost surely, 2123649419980 is an apocalyptic number.
123649419980 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
123649419980 is an abundant number, since it is smaller than the sum of its proper divisors (136158615220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123649419980 is a wasteful number, since it uses less digits than its factorization.
123649419980 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3434609 (or 3434607 counting only the distinct ones).
The product of its (nonzero) digits is 3359232, while the sum is 56.
The spelling of 123649419980 in words is "one hundred twenty-three billion, six hundred forty-nine million, four hundred nineteen thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •