Base | Representation |
---|---|
bin | 10100110011111111110… |
… | …000111000000111001101 |
3 | 12001201122111112020011020 |
4 | 110303333300320013031 |
5 | 141413042324120401 |
6 | 3013011205144353 |
7 | 205221121435236 |
oct | 24637760700715 |
9 | 5051574466136 |
10 | 1430220145101 |
11 | 501609a93620 |
12 | 1b12299bb0b9 |
13 | a4b3b78a737 |
14 | 4d319d9c08d |
15 | 2730b271d36 |
hex | 14cffc381cd |
1430220145101 has 32 divisors (see below), whose sum is σ = 2240736622080. Its totient is φ = 802081828800.
The previous prime is 1430220145099. The next prime is 1430220145147. The reversal of 1430220145101 is 1015410220341.
It is not a de Polignac number, because 1430220145101 - 21 = 1430220145099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1430220145181) 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 31 ways as a sum of consecutive naturals, for example, 26496910 + ... + 26550831.
It is an arithmetic number, because the mean of its divisors is an integer number (70023019440).
Almost surely, 21430220145101 is an apocalyptic number.
1430220145101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1430220145101 is a deficient number, since it is larger than the sum of its proper divisors (810516476979).
1430220145101 is a wasteful number, since it uses less digits than its factorization.
1430220145101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53047817.
The product of its (nonzero) digits is 960, while the sum is 24.
Adding to 1430220145101 its reverse (1015410220341), we get a palindrome (2445630365442).
The spelling of 1430220145101 in words is "one trillion, four hundred thirty billion, two hundred twenty million, one hundred forty-five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •