Base | Representation |
---|---|
bin | 101111001011000100… |
… | …1011110011001111001 |
3 | 100200111000001120000010 |
4 | 1132112021132121321 |
5 | 3124432122022131 |
6 | 114312121332133 |
7 | 10214250650616 |
oct | 1362611363171 |
9 | 320430046003 |
10 | 101303314041 |
11 | 39a65097246 |
12 | 17772337049 |
13 | 9725837c97 |
14 | 4c901a550d |
15 | 297d881b46 |
hex | 179625e679 |
101303314041 has 8 divisors (see below), whose sum is σ = 143016443424. Its totient is φ = 63562863680.
The previous prime is 101303314037. The next prime is 101303314081. The reversal of 101303314041 is 140413303101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101303314041 - 22 = 101303314037 is a prime.
It is a super-3 number, since 3×1013033140413 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 101303313999 and 101303314017.
It is not an unprimeable number, because it can be changed into a prime (101303314001) 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, 993169695 + ... + 993169796.
It is an arithmetic number, because the mean of its divisors is an integer number (17877055428).
Almost surely, 2101303314041 is an apocalyptic number.
It is an amenable number.
101303314041 is a deficient number, since it is larger than the sum of its proper divisors (41713129383).
101303314041 is a wasteful number, since it uses less digits than its factorization.
101303314041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1986339511.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 101303314041 its reverse (140413303101), we get a palindrome (241716617142).
The spelling of 101303314041 in words is "one hundred one billion, three hundred three million, three hundred fourteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •