Base | Representation |
---|---|
bin | 111011101011110000010… |
… | …101100101001100100001 |
3 | 112112002111202222211212201 |
4 | 323223300111211030201 |
5 | 1014144212313131401 |
6 | 12420101004053201 |
7 | 602214166124011 |
oct | 73536025451441 |
9 | 15462452884781 |
10 | 4101430989601 |
11 | 1341452962400 |
12 | 562a74b34201 |
13 | 2399bcc1718a |
14 | 10272045bc41 |
15 | 71a4ab5bb01 |
hex | 3baf0565321 |
4101430989601 has 27 divisors (see below), whose sum is σ = 4659085410609. Its totient is φ = 3607689498600.
The previous prime is 4101430989581. The next prime is 4101430989637. The reversal of 4101430989601 is 1069890341014.
The square root of 4101430989601 is 2025199.
It is a perfect power (a square), and thus also a powerful number.
4101430989601 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 4101430989601 - 211 = 4101430987553 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4101430981601) 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, 690589890 + ... + 690595828.
Almost surely, 24101430989601 is an apocalyptic number.
4101430989601 is the 2025199-th square number.
4101430989601 is the 1012600-th centered octagonal number.
It is an amenable number.
4101430989601 is a deficient number, since it is larger than the sum of its proper divisors (557654421008).
4101430989601 is an frugal number, since it uses more digits than its factorization.
4101430989601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11962 (or 5981 counting only the distinct ones).
The product of its (nonzero) digits is 186624, while the sum is 46.
The spelling of 4101430989601 in words is "four trillion, one hundred one billion, four hundred thirty million, nine hundred eighty-nine thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •