Base | Representation |
---|---|
bin | 10100101011011100001… |
… | …011111101010101010000 |
3 | 12000211221020220200000002 |
4 | 110223130023331111100 |
5 | 141240234013030000 |
6 | 3004451431545132 |
7 | 204444350002604 |
oct | 24533413752520 |
9 | 5024836820002 |
10 | 1421033330000 |
11 | 4a87252a5449 |
12 | 1ab4a522b1a8 |
13 | a40063bb57b |
14 | 4cac7c37504 |
15 | 26e6e9928d5 |
hex | 14adc2fd550 |
1421033330000 has 100 divisors (see below), whose sum is σ = 3487595227908. Its totient is φ = 560626560000.
The previous prime is 1421033329987. The next prime is 1421033330027. The reversal of 1421033330000 is 333301241.
It can be written as a sum of positive squares in 10 ways, for example, as 1227859015744 + 193174314256 = 1108088^2 + 439516^2 .
It is a tau number, because it is divible by the number of its divisors (100).
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 243311 + ... + 1703310.
Almost surely, 21421033330000 is an apocalyptic number.
1421033330000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1421033330000 is an abundant number, since it is smaller than the sum of its proper divisors (2066561897908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1421033330000 is an equidigital number, since it uses as much as digits as its factorization.
1421033330000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1946722 (or 1946701 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 1421033330000 its reverse (333301241), we get a palindrome (1421366631241).
The spelling of 1421033330000 in words is "one trillion, four hundred twenty-one billion, thirty-three million, three hundred thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •