Base | Representation |
---|---|
bin | 10100110100111010111… |
… | …001011001011010100001 |
3 | 12001211012122022120211101 |
4 | 110310322321121122201 |
5 | 141422110313000101 |
6 | 3013253445114401 |
7 | 205254526160665 |
oct | 24647271313241 |
9 | 5054178276741 |
10 | 1431212234401 |
11 | 501a78aa3a34 |
12 | 1b14660b8a01 |
13 | a4c69188021 |
14 | 4d3b1a4a8a5 |
15 | 273683de401 |
hex | 14d3ae596a1 |
1431212234401 has 12 divisors (see below), whose sum is σ = 1505674027732. Its totient is φ = 1360265882976.
The previous prime is 1431212234363. The next prime is 1431212234423. The reversal of 1431212234401 is 1044322121341.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 512971088400 + 918241146001 = 716220^2 + 958249^2 .
It is not a de Polignac number, because 1431212234401 - 27 = 1431212234273 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 1431212234401.
It is not an unprimeable number, because it can be changed into a prime (1431212234461) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8533206 + ... + 8699311.
Almost surely, 21431212234401 is an apocalyptic number.
It is an amenable number.
1431212234401 is a deficient number, since it is larger than the sum of its proper divisors (74461793331).
1431212234401 is a wasteful number, since it uses less digits than its factorization.
1431212234401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17232720 (or 17232697 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 1431212234401 its reverse (1044322121341), we get a palindrome (2475534355742).
The spelling of 1431212234401 in words is "one trillion, four hundred thirty-one billion, two hundred twelve million, two hundred thirty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •