Base | Representation |
---|---|
bin | 1100010100000100010… |
… | …1110110101110001001 |
3 | 202020000222002101101120 |
4 | 3011001011312232021 |
5 | 11431221113421101 |
6 | 241103241105453 |
7 | 21166202445114 |
oct | 3050105665611 |
9 | 666028071346 |
10 | 211545451401 |
11 | 8179698a779 |
12 | 34bba188289 |
13 | 16c4425381b |
14 | a34b5b957b |
15 | 5781d58b36 |
hex | 3141176b89 |
211545451401 has 8 divisors (see below), whose sum is σ = 282087913920. Its totient is φ = 141016644912.
The previous prime is 211545451393. The next prime is 211545451409. The reversal of 211545451401 is 104154545112.
It is an interprime number because it is at equal distance from previous prime (211545451393) and next prime (211545451409).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 211545451401 - 23 = 211545451393 is a prime.
It is not an unprimeable number, because it can be changed into a prime (211545451409) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3377806 + ... + 3439863.
It is an arithmetic number, because the mean of its divisors is an integer number (35260989240).
Almost surely, 2211545451401 is an apocalyptic number.
It is an amenable number.
211545451401 is a deficient number, since it is larger than the sum of its proper divisors (70542462519).
211545451401 is a wasteful number, since it uses less digits than its factorization.
211545451401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6828015.
The product of its (nonzero) digits is 16000, while the sum is 33.
Adding to 211545451401 its reverse (104154545112), we get a palindrome (315699996513).
The spelling of 211545451401 in words is "two hundred eleven billion, five hundred forty-five million, four hundred fifty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •