Base | Representation |
---|---|
bin | 10111000010011001111001… |
… | …010010000110100100110101 |
3 | 111021202010102211201121100111 |
4 | 113002121321102012210311 |
5 | 101240013000201120201 |
6 | 555253524230543021 |
7 | 30225102550056463 |
oct | 2702317122064465 |
9 | 437663384647314 |
10 | 101320313301301 |
11 | 2a313781497286 |
12 | b44467bb07a71 |
13 | 446c6067c21a3 |
14 | 1b03d02119833 |
15 | baa891beab51 |
hex | 5c2679486935 |
101320313301301 has 8 divisors (see below), whose sum is σ = 101356927998624. Its totient is φ = 101283705224400.
The previous prime is 101320313301281. The next prime is 101320313301341. The reversal of 101320313301301 is 103103313023101.
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 101320313301301 - 25 = 101320313301269 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101320313301341) 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, 29061726 + ... + 32360848.
It is an arithmetic number, because the mean of its divisors is an integer number (12669615999828).
Almost surely, 2101320313301301 is an apocalyptic number.
It is an amenable number.
101320313301301 is a deficient number, since it is larger than the sum of its proper divisors (36614697323).
101320313301301 is an equidigital number, since it uses as much as digits as its factorization.
101320313301301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3310211.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 101320313301301 its reverse (103103313023101), we get a palindrome (204423626324402).
The spelling of 101320313301301 in words is "one hundred one trillion, three hundred twenty billion, three hundred thirteen million, three hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •