Base | Representation |
---|---|
bin | 111111011110111… |
… | …0001100011111000 |
3 | 12111110012110102110 |
4 | 1332331301203320 |
5 | 13330302414000 |
6 | 551211532320 |
7 | 103533514065 |
oct | 17675614370 |
9 | 5443173373 |
10 | 2130123000 |
11 | 9a3442a35 |
12 | 4b545a0a0 |
13 | 27c406b15 |
14 | 162c8bc6c |
15 | c7017850 |
hex | 7ef718f8 |
2130123000 has 128 divisors (see below), whose sum is σ = 6771885120. Its totient is φ = 557273600.
The previous prime is 2130122999. The next prime is 2130123019. The reversal of 2130123000 is 3210312.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 152302 + ... + 165698.
Almost surely, 22130123000 is an apocalyptic number.
2130123000 is a gapful number since it is divisible by the number (20) 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 2130123000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3385942560).
2130123000 is an abundant number, since it is smaller than the sum of its proper divisors (4641762120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2130123000 is a wasteful number, since it uses less digits than its factorization.
2130123000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13474 (or 13460 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
The square root of 2130123000 is about 46153.2555731446. The cubic root of 2130123000 is about 1286.6731172176.
Adding to 2130123000 its reverse (3210312), we get a palindrome (2133333312).
The spelling of 2130123000 in words is "two billion, one hundred thirty million, one hundred twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •