Base | Representation |
---|---|
bin | 101111110001101100011010… |
… | …000011101101110101100000 |
3 | 1000112222120111200000022121102 |
4 | 233301230122003231311200 |
5 | 210020124123241012000 |
6 | 2022521121342413532 |
7 | 62154615564311105 |
oct | 5761543203556540 |
9 | 1015876450008542 |
10 | 210123122204000 |
11 | 60a51796649575 |
12 | 1b6973285912a8 |
13 | 90326aa402145 |
14 | 39c60289d2aac |
15 | 1945bb811a3d5 |
hex | bf1b1a0edd60 |
210123122204000 has 48 divisors (see below), whose sum is σ = 516272511265056. Its totient is φ = 84049248880000.
The previous prime is 210123122203991. The next prime is 210123122204053. The reversal of 210123122204000 is 402221321012.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26265386276 + ... + 26265394275.
It is an arithmetic number, because the mean of its divisors is an integer number (10755677318022).
Almost surely, 2210123122204000 is an apocalyptic number.
210123122204000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
210123122204000 is an abundant number, since it is smaller than the sum of its proper divisors (306149389061056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210123122204000 is an equidigital number, since it uses as much as digits as its factorization.
210123122204000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52530780576 (or 52530780558 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 210123122204000 its reverse (402221321012), we get a palindrome (210525343525012).
The spelling of 210123122204000 in words is "two hundred ten trillion, one hundred twenty-three billion, one hundred twenty-two million, two hundred four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •