Base | Representation |
---|---|
bin | 10100110100000001110… |
… | …111000011101111000001 |
3 | 12001201201221201022001022 |
4 | 110310001313003233001 |
5 | 141413130330220001 |
6 | 3013014503115225 |
7 | 205222026426044 |
oct | 24640167035701 |
9 | 5051657638038 |
10 | 1430255320001 |
11 | 501627928a92 |
12 | 1b1239742b15 |
13 | a4b45b54ca1 |
14 | 4d320916c5b |
15 | 2730e3be11b |
hex | 14d01dc3bc1 |
1430255320001 has 4 divisors (see below), whose sum is σ = 1430942614404. Its totient is φ = 1429568025600.
The previous prime is 1430255319973. The next prime is 1430255320033. The reversal of 1430255320001 is 1000235520341.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1036423766401 + 393831553600 = 1018049^2 + 627560^2 .
It is a cyclic number.
It is not a de Polignac number, because 1430255320001 - 218 = 1430255057857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1430255320051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 343644080 + ... + 343648241.
It is an arithmetic number, because the mean of its divisors is an integer number (357735653601).
Almost surely, 21430255320001 is an apocalyptic number.
It is an amenable number.
1430255320001 is a deficient number, since it is larger than the sum of its proper divisors (687294403).
1430255320001 is an equidigital number, since it uses as much as digits as its factorization.
1430255320001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 687294402.
The product of its (nonzero) digits is 3600, while the sum is 26.
The spelling of 1430255320001 in words is "one trillion, four hundred thirty billion, two hundred fifty-five million, three hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •