Base | Representation |
---|---|
bin | 1101000000011001010000… |
… | …1111110100001001110100 |
3 | 1212122002220210012000021202 |
4 | 3100012110033310021310 |
5 | 3333244241411132012 |
6 | 50225310043232032 |
7 | 3004113032315435 |
oct | 320062417641164 |
9 | 55562823160252 |
10 | 14300433302132 |
11 | 461386387321a |
12 | 172b62a218618 |
13 | 7c96a9784143 |
14 | 376204d6348c |
15 | 19bec164ccc2 |
hex | d01943f4274 |
14300433302132 has 6 divisors (see below), whose sum is σ = 25025758278738. Its totient is φ = 7150216651064.
The previous prime is 14300433302123. The next prime is 14300433302153. The reversal of 14300433302132 is 23120333400341.
It can be written as a sum of positive squares in only one way, i.e., 7860643971856 + 6439789330276 = 2803684^2 + 2537674^2 .
It is a junction number, because it is equal to n+sod(n) for n = 14300433302095 and 14300433302104.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1787554162763 + ... + 1787554162770.
It is an arithmetic number, because the mean of its divisors is an integer number (4170959713123).
Almost surely, 214300433302132 is an apocalyptic number.
It is an amenable number.
14300433302132 is a deficient number, since it is larger than the sum of its proper divisors (10725324976606).
14300433302132 is a wasteful number, since it uses less digits than its factorization.
14300433302132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3575108325537 (or 3575108325535 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 29.
Adding to 14300433302132 its reverse (23120333400341), we get a palindrome (37420766702473).
The spelling of 14300433302132 in words is "fourteen trillion, three hundred billion, four hundred thirty-three million, three hundred two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •