Base | Representation |
---|---|
bin | 10100110101000000101… |
… | …111011111001101100111 |
3 | 12001211110110211211112212 |
4 | 110311000233133031213 |
5 | 141422310414100012 |
6 | 3013311311034035 |
7 | 205260126545360 |
oct | 24650057371547 |
9 | 5054413754485 |
10 | 1431310300007 |
11 | 502019394095 |
12 | 1b1492b0b91b |
13 | a4c835a2203 |
14 | 4d3c0a96b67 |
15 | 27371d10b22 |
hex | 14d40bdf367 |
1431310300007 has 16 divisors (see below), whose sum is σ = 1796741276160. Its totient is φ = 1111733659872.
The previous prime is 1431310299983. The next prime is 1431310300037. The reversal of 1431310300007 is 7000030131341.
It is not a de Polignac number, because 1431310300007 - 210 = 1431310298983 is a prime.
It is a super-2 number, since 2×14313103000072 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1431310300037) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 233947628 + ... + 233953745.
It is an arithmetic number, because the mean of its divisors is an integer number (112296329760).
Almost surely, 21431310300007 is an apocalyptic number.
1431310300007 is a deficient number, since it is larger than the sum of its proper divisors (365430976153).
1431310300007 is a wasteful number, since it uses less digits than its factorization.
1431310300007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 467901422.
The product of its (nonzero) digits is 756, while the sum is 23.
Adding to 1431310300007 its reverse (7000030131341), we get a palindrome (8431340431348).
The spelling of 1431310300007 in words is "one trillion, four hundred thirty-one billion, three hundred ten million, three hundred thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •