Base | Representation |
---|---|
bin | 11110111001001100101… |
… | …011001011000011011110 |
3 | 21111221211112110221110020 |
4 | 132321030223023003132 |
5 | 234240401024330420 |
6 | 4303143130453010 |
7 | 306244632132024 |
oct | 36711453130336 |
9 | 7457745427406 |
10 | 2123000230110 |
11 | 7493a5313221 |
12 | 2a3550594166 |
13 | 1252761b3916 |
14 | 74a7a45c714 |
15 | 3a356570340 |
hex | 1ee4cacb0de |
2123000230110 has 32 divisors (see below), whose sum is σ = 5097670502400. Its totient is φ = 565858955808.
The previous prime is 2123000230069. The next prime is 2123000230147. The reversal of 2123000230110 is 110320003212.
It is a super-2 number, since 2×21230002301102 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 2123000230110.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17089510 + ... + 17213289.
It is an arithmetic number, because the mean of its divisors is an integer number (159302203200).
Almost surely, 22123000230110 is an apocalyptic number.
2123000230110 is an abundant number, since it is smaller than the sum of its proper divisors (2974670272290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2123000230110 is a wasteful number, since it uses less digits than its factorization.
2123000230110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34304872.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 2123000230110 its reverse (110320003212), we get a palindrome (2233320233322).
The spelling of 2123000230110 in words is "two trillion, one hundred twenty-three billion, two hundred thirty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •