Base | Representation |
---|---|
bin | 10100110011111111010… |
… | …110000010110100111111 |
3 | 12001201122000021212022210 |
4 | 110303333112002310333 |
5 | 141413034024023403 |
6 | 3013010354311503 |
7 | 205221004601040 |
oct | 24637726026477 |
9 | 5051560255283 |
10 | 1430213111103 |
11 | 5016060198a7 |
12 | 1b1227588593 |
13 | a4b3a196bca |
14 | 4d31908a8c7 |
15 | 2730a832b03 |
hex | 14cff582d3f |
1430213111103 has 32 divisors (see below), whose sum is σ = 2190965776384. Its totient is φ = 812928055392.
The previous prime is 1430213111101. The next prime is 1430213111167. The reversal of 1430213111103 is 3011113120341.
It is not a de Polignac number, because 1430213111103 - 21 = 1430213111101 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 1430213111103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1430213111101) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2911926 + ... + 3367452.
It is an arithmetic number, because the mean of its divisors is an integer number (68467680512).
Almost surely, 21430213111103 is an apocalyptic number.
1430213111103 is a deficient number, since it is larger than the sum of its proper divisors (760752665281).
1430213111103 is a wasteful number, since it uses less digits than its factorization.
1430213111103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 456331.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 1430213111103 its reverse (3011113120341), we get a palindrome (4441326231444).
The spelling of 1430213111103 in words is "one trillion, four hundred thirty billion, two hundred thirteen million, one hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •