Base | Representation |
---|---|
bin | 10100011000111110110… |
… | …000011001001110001001 |
3 | 11221221202212222112212111 |
4 | 110120332300121032021 |
5 | 140424140311241410 |
6 | 2551412532342321 |
7 | 203143226200066 |
oct | 24307660311611 |
9 | 4857685875774 |
10 | 1401212212105 |
11 | 4a0283845182 |
12 | 1a76931749a1 |
13 | a2197ab5a44 |
14 | 4bb675d7c6d |
15 | 266ae7adb8a |
hex | 1463ec19389 |
1401212212105 has 4 divisors (see below), whose sum is σ = 1681454654532. Its totient is φ = 1120969769680.
The previous prime is 1401212212091. The next prime is 1401212212111. The reversal of 1401212212105 is 5012122121041.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 235313278281 + 1165898933824 = 485091^2 + 1079768^2 .
It is not a de Polignac number, because 1401212212105 - 29 = 1401212211593 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 140121221206 + ... + 140121221215.
It is an arithmetic number, because the mean of its divisors is an integer number (420363663633).
Almost surely, 21401212212105 is an apocalyptic number.
It is an amenable number.
1401212212105 is a deficient number, since it is larger than the sum of its proper divisors (280242442427).
1401212212105 is an equidigital number, since it uses as much as digits as its factorization.
1401212212105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280242442426.
The product of its (nonzero) digits is 320, while the sum is 22.
Adding to 1401212212105 its reverse (5012122121041), we get a palindrome (6413334333146).
The spelling of 1401212212105 in words is "one trillion, four hundred one billion, two hundred twelve million, two hundred twelve thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •