Base | Representation |
---|---|
bin | 111101000111110000001… |
… | …010110000101101111101 |
3 | 112212112111000122110212001 |
4 | 331013300022300231331 |
5 | 1022304013333313041 |
6 | 12533315000342301 |
7 | 612312115224100 |
oct | 75076012605575 |
9 | 15775430573761 |
10 | 4200212401021 |
11 | 137a3334458aa |
12 | 57a042774991 |
13 | 246103124590 |
14 | 107411710737 |
15 | 743ccdd8131 |
hex | 3d1f02b0b7d |
4200212401021 has 48 divisors (see below), whose sum is σ = 5327428796928. Its totient is φ = 3281831683200.
The previous prime is 4200212400983. The next prime is 4200212401051. The reversal of 4200212401021 is 1201042120024.
It is not a de Polignac number, because 4200212401021 - 221 = 4200210303869 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4200212401021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4200212401051) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 136973431 + ... + 137004091.
It is an arithmetic number, because the mean of its divisors is an integer number (110988099936).
Almost surely, 24200212401021 is an apocalyptic number.
It is an amenable number.
4200212401021 is a deficient number, since it is larger than the sum of its proper divisors (1127216395907).
4200212401021 is a wasteful number, since it uses less digits than its factorization.
4200212401021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33362 (or 33355 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 4200212401021 its reverse (1201042120024), we get a palindrome (5401254521045).
The spelling of 4200212401021 in words is "four trillion, two hundred billion, two hundred twelve million, four hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •