Base | Representation |
---|---|
bin | 10111000111010110110111… |
… | …100111111000000111110001 |
3 | 111022221122221022010020110220 |
4 | 113013112313213320013301 |
5 | 101311102013333104131 |
6 | 1000114132504243253 |
7 | 30261511652016066 |
oct | 2707266747700761 |
9 | 438848838106426 |
10 | 101660661613041 |
11 | 2a435054213363 |
12 | b49a625a70529 |
13 | 44957368b7c6b |
14 | 1b1658bbb6c6d |
15 | bb4661744e96 |
hex | 5c75b79f81f1 |
101660661613041 has 8 divisors (see below), whose sum is σ = 135557401859904. Its totient is φ = 67768847887440.
The previous prime is 101660661613003. The next prime is 101660661613117. The reversal of 101660661613041 is 140316166066101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101660661613041 - 211 = 101660661610993 is a prime.
It is a super-3 number, since 3×1016606616130413 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101660661612984 and 101660661613002.
It is not an unprimeable number, because it can be changed into a prime (101660661613541) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1231582165 + ... + 1231664706.
It is an arithmetic number, because the mean of its divisors is an integer number (16944675232488).
Almost surely, 2101660661613041 is an apocalyptic number.
It is an amenable number.
101660661613041 is a deficient number, since it is larger than the sum of its proper divisors (33896740246863).
101660661613041 is a wasteful number, since it uses less digits than its factorization.
101660661613041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2463260631.
The product of its (nonzero) digits is 93312, while the sum is 42.
The spelling of 101660661613041 in words is "one hundred one trillion, six hundred sixty billion, six hundred sixty-one million, six hundred thirteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •