Base | Representation |
---|---|
bin | 10010111110101000100… |
… | …111110100011100101110 |
3 | 11121200101020002221012020 |
4 | 102332220213310130232 |
5 | 132332002222221142 |
6 | 2435050524051010 |
7 | 163140251644005 |
oct | 22765047643456 |
9 | 4550336087166 |
10 | 1304204101422 |
11 | 46312323a882 |
12 | 19091b393a66 |
13 | 95ca80aac11 |
14 | 471a3a6bc3c |
15 | 23dd3064cec |
hex | 12fa89f472e |
1304204101422 has 8 divisors (see below), whose sum is σ = 2608408202856. Its totient is φ = 434734700472.
The previous prime is 1304204101397. The next prime is 1304204101433. The reversal of 1304204101422 is 2241014024031.
It is a sphenic number, since it is the product of 3 distinct primes.
1304204101422 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 1304204101392 and 1304204101401.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 108683675113 + ... + 108683675124.
It is an arithmetic number, because the mean of its divisors is an integer number (326051025357).
Almost surely, 21304204101422 is an apocalyptic number.
1304204101422 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1304204101422 is a wasteful number, since it uses less digits than its factorization.
1304204101422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217367350242.
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 1304204101422 its reverse (2241014024031), we get a palindrome (3545218125453).
The spelling of 1304204101422 in words is "one trillion, three hundred four billion, two hundred four million, one hundred one thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •