Base | Representation |
---|---|
bin | 10100110010010100100… |
… | …001100001100001111101 |
3 | 12001120000010001001220021 |
4 | 110302110201201201331 |
5 | 141400401231131313 |
6 | 3012112454252141 |
7 | 205125413545615 |
oct | 24622441414175 |
9 | 5046003031807 |
10 | 1428420958333 |
11 | 500876434a06 |
12 | 1b0a07357051 |
13 | a4912ac3895 |
14 | 4d1c9057a45 |
15 | 2725332978d |
hex | 14c9486187d |
1428420958333 has 4 divisors (see below), whose sum is σ = 1428884283168. Its totient is φ = 1427957633500.
The previous prime is 1428420958331. The next prime is 1428420958409. The reversal of 1428420958333 is 3338590248241.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1428420958333 - 21 = 1428420958331 is a prime.
It is a super-2 number, since 2×14284209583332 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1428420958331) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 231657793 + ... + 231663958.
It is an arithmetic number, because the mean of its divisors is an integer number (357221070792).
Almost surely, 21428420958333 is an apocalyptic number.
It is an amenable number.
1428420958333 is a deficient number, since it is larger than the sum of its proper divisors (463324835).
1428420958333 is an equidigital number, since it uses as much as digits as its factorization.
1428420958333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 463324834.
The product of its (nonzero) digits is 4976640, while the sum is 52.
The spelling of 1428420958333 in words is "one trillion, four hundred twenty-eight billion, four hundred twenty million, nine hundred fifty-eight thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •