Base | Representation |
---|---|
bin | 10100101010100101001… |
… | …011111000000001111101 |
3 | 12000202112221120011110110 |
4 | 110222211023320001331 |
5 | 141231341300431110 |
6 | 3004220105500233 |
7 | 204412443414264 |
oct | 24524513700175 |
9 | 5022487504413 |
10 | 1420110561405 |
11 | 4a82a1431778 |
12 | 1ab2881a1679 |
13 | a3bba182553 |
14 | 4ca3b4715db |
15 | 26e18969a20 |
hex | 14aa52f807d |
1420110561405 has 8 divisors (see below), whose sum is σ = 2272176898272. Its totient is φ = 757392299408.
The previous prime is 1420110561371. The next prime is 1420110561421. The reversal of 1420110561405 is 5041650110241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1420110561405 - 218 = 1420110299261 is a prime.
It is a super-2 number, since 2×14201105614052 (a number of 25 digits) contains 22 as substring.
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, 47337018699 + ... + 47337018728.
It is an arithmetic number, because the mean of its divisors is an integer number (284022112284).
Almost surely, 21420110561405 is an apocalyptic number.
1420110561405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1420110561405 is a deficient number, since it is larger than the sum of its proper divisors (852066336867).
1420110561405 is an equidigital number, since it uses as much as digits as its factorization.
1420110561405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94674037435.
The product of its (nonzero) digits is 4800, while the sum is 30.
Adding to 1420110561405 its reverse (5041650110241), we get a palindrome (6461760671646).
The spelling of 1420110561405 in words is "one trillion, four hundred twenty billion, one hundred ten million, five hundred sixty-one thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •