Base | Representation |
---|---|
bin | 11111110101010011011010… |
… | …100101011010110000001011 |
3 | 200100201002201110012101100022 |
4 | 133311103122211122300023 |
5 | 121322244424313104121 |
6 | 1213432120250131055 |
7 | 41326561340242406 |
oct | 3765233245326013 |
9 | 610632643171308 |
10 | 140002421222411 |
11 | 40677769a19500 |
12 | 138514a7720a8b |
13 | 6017230219c97 |
14 | 2680220ab2d3d |
15 | 112bbb6d55aab |
hex | 7f54da95ac0b |
140002421222411 has 6 divisors (see below), whose sum is σ = 153886958864436. Its totient is φ = 127274928383900.
The previous prime is 140002421222407. The next prime is 140002421222501. The reversal of 140002421222411 is 114222124200041.
It is not a de Polignac number, because 140002421222411 - 22 = 140002421222407 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140002421272411) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 578522401625 + ... + 578522401866.
It is an arithmetic number, because the mean of its divisors is an integer number (25647826477406).
Almost surely, 2140002421222411 is an apocalyptic number.
140002421222411 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
140002421222411 is a deficient number, since it is larger than the sum of its proper divisors (13884537642025).
140002421222411 is a wasteful number, since it uses less digits than its factorization.
140002421222411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1157044803513 (or 1157044803502 counting only the distinct ones).
The product of its (nonzero) digits is 2048, while the sum is 26.
Adding to 140002421222411 its reverse (114222124200041), we get a palindrome (254224545422452).
The spelling of 140002421222411 in words is "one hundred forty trillion, two billion, four hundred twenty-one million, two hundred twenty-two thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •