Base | Representation |
---|---|
bin | 101111001000000001… |
… | …1000100001110010001 |
3 | 100200012212110222020211 |
4 | 1132100003010032101 |
5 | 3124224422030031 |
6 | 114254024004121 |
7 | 10211566025431 |
oct | 1362003041621 |
9 | 320185428224 |
10 | 101200970641 |
11 | 39a12345121 |
12 | 17744000641 |
13 | 970a583964 |
14 | 4c807642c1 |
15 | 29748b7bb1 |
hex | 17900c4391 |
101200970641 has 9 divisors (see below), whose sum is σ = 107509890481. Its totient is φ = 95242882432.
The previous prime is 101200970621. The next prime is 101200970677. The reversal of 101200970641 is 146079002101.
The square root of 101200970641 is 318121.
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 33079970641 + 68121000000 = 181879^2 + 261000^2 .
It is not a de Polignac number, because 101200970641 - 223 = 101192582033 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101200970621) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 5398701 + ... + 5417413.
Almost surely, 2101200970641 is an apocalyptic number.
101200970641 is the 318121-st square number.
101200970641 is the 159061-st centered octagonal number.
It is an amenable number.
101200970641 is a deficient number, since it is larger than the sum of its proper divisors (6308919840).
101200970641 is an frugal number, since it uses more digits than its factorization.
101200970641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37460 (or 18730 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 31.
Adding to 101200970641 its reverse (146079002101), we get a palindrome (247279972742).
The spelling of 101200970641 in words is "one hundred one billion, two hundred million, nine hundred seventy thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •