Base | Representation |
---|---|
bin | 101111110001111111110111… |
… | …001000001100011110101100 |
3 | 1000120001120102102222201020102 |
4 | 233301333313020030132230 |
5 | 210020444413304341022 |
6 | 2022534454222210232 |
7 | 62156255331251030 |
oct | 5761776710143654 |
9 | 1016046372881212 |
10 | 210144011012012 |
11 | 60a5a635856170 |
12 | 1b69b398123978 |
13 | 9034658c8517c |
14 | 39c704ad601c0 |
15 | 19464dbe01a92 |
hex | bf1ff720c7ac |
210144011012012 has 24 divisors (see below), whose sum is σ = 458496024026880. Its totient is φ = 81874290004560.
The previous prime is 210144011011951. The next prime is 210144011012021. The reversal of 210144011012012 is 210210110441012.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 341142874712 + ... + 341142875327.
It is an arithmetic number, because the mean of its divisors is an integer number (19104001001120).
Almost surely, 2210144011012012 is an apocalyptic number.
210144011012012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
210144011012012 is an abundant number, since it is smaller than the sum of its proper divisors (248352013014868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210144011012012 is a wasteful number, since it uses less digits than its factorization.
210144011012012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 682285750061 (or 682285750059 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 210144011012012 its reverse (210210110441012), we get a palindrome (420354121453024).
The spelling of 210144011012012 in words is "two hundred ten trillion, one hundred forty-four billion, eleven million, twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •