Base | Representation |
---|---|
bin | 10100110100111010011… |
… | …010000100010001011101 |
3 | 12001211012001212022121222 |
4 | 110310322122010101131 |
5 | 141422101212140331 |
6 | 3013252553103125 |
7 | 205254366313133 |
oct | 24647232042135 |
9 | 5054161768558 |
10 | 1431204021341 |
11 | 501a743a4386 |
12 | 1b14633b7aa5 |
13 | a4c67570923 |
14 | 4d3b090d753 |
15 | 2736781ab7b |
hex | 14d3a68445d |
1431204021341 has 8 divisors (see below), whose sum is σ = 1508041632480. Its totient is φ = 1354517518608.
The previous prime is 1431204021337. The next prime is 1431204021353.
1431204021341 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1431204021341 - 22 = 1431204021337 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1431204021341.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1431204021301) 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 7 ways as a sum of consecutive naturals, for example, 37757651 + ... + 37795536.
It is an arithmetic number, because the mean of its divisors is an integer number (188505204060).
Almost surely, 21431204021341 is an apocalyptic number.
It is an amenable number.
1431204021341 is a deficient number, since it is larger than the sum of its proper divisors (76837611139).
1431204021341 is an equidigital number, since it uses as much as digits as its factorization.
1431204021341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75554203.
The product of its (nonzero) digits is 2304, while the sum is 26.
The spelling of 1431204021341 in words is "one trillion, four hundred thirty-one billion, two hundred four million, twenty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •