Base | Representation |
---|---|
bin | 10100110100011110100… |
… | …010110010100010100100 |
3 | 12001202222111020002221211 |
4 | 110310132202302202210 |
5 | 141420122023432311 |
6 | 3013134333321204 |
7 | 205236661661134 |
oct | 24643642624244 |
9 | 5052874202854 |
10 | 1430736545956 |
11 | 501854532193 |
12 | 1b1352936204 |
13 | a4bc1765983 |
14 | 4d3687c2ac4 |
15 | 2733b779821 |
hex | 14d1e8b28a4 |
1430736545956 has 81 divisors (see below), whose sum is σ = 2663187275203. Its totient is φ = 672514380160.
The previous prime is 1430736545951. The next prime is 1430736545971. The reversal of 1430736545956 is 6595456370341.
The square root of 1430736545956 is 1196134.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 377814291556 + 1052922254400 = 614666^2 + 1026120^2 .
It is a Harshad number since it is a multiple of its sum of digits (58).
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 1430736545956.
It is not an unprimeable number, because it can be changed into a prime (1430736545951) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 2844406401 + ... + 2844406903.
Almost surely, 21430736545956 is an apocalyptic number.
1430736545956 is the 1196134-th square number.
It is an amenable number.
1430736545956 is a deficient number, since it is larger than the sum of its proper divisors (1232450729247).
1430736545956 is an frugal number, since it uses more digits than its factorization.
1430736545956 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1150 (or 575 counting only the distinct ones).
The product of its (nonzero) digits is 40824000, while the sum is 58.
The spelling of 1430736545956 in words is "one trillion, four hundred thirty billion, seven hundred thirty-six million, five hundred forty-five thousand, nine hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •