Base | Representation |
---|---|
bin | 10100110110000010010… |
… | …100000010100011101011 |
3 | 12001221022010212202102012 |
4 | 110312002110002203223 |
5 | 141432034030313003 |
6 | 3014012410030135 |
7 | 205326315342041 |
oct | 24660224024353 |
9 | 5057263782365 |
10 | 1432410401003 |
11 | 50253336826a |
12 | 1b173b41834b |
13 | a50ca489b4a |
14 | 4d486c20391 |
15 | 273d86b68d8 |
hex | 14d825028eb |
1432410401003 has 8 divisors (see below), whose sum is σ = 1436446195200. Its totient is φ = 1428374861928.
The previous prime is 1432410400931. The next prime is 1432410401053. The reversal of 1432410401003 is 3001040142341.
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 1432410401003 - 238 = 1157532494059 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 1432410401003.
It is not an unprimeable number, because it can be changed into a prime (1432410401053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20132750 + ... + 20203772.
It is an arithmetic number, because the mean of its divisors is an integer number (179555774400).
Almost surely, 21432410401003 is an apocalyptic number.
1432410401003 is a deficient number, since it is larger than the sum of its proper divisors (4035794197).
1432410401003 is an equidigital number, since it uses as much as digits as its factorization.
1432410401003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127561.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 1432410401003 its reverse (3001040142341), we get a palindrome (4433450543344).
The spelling of 1432410401003 in words is "one trillion, four hundred thirty-two billion, four hundred ten million, four hundred one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •