Base | Representation |
---|---|
bin | 11101001001000110110… |
… | …01101010100001011101 |
3 | 10112201120210200221110121 |
4 | 32210203121222201131 |
5 | 112401201223412201 |
6 | 2044000050434541 |
7 | 132225450463444 |
oct | 16444331524135 |
9 | 3481523627417 |
10 | 1001321310301 |
11 | 356726858984 |
12 | 142090592a51 |
13 | 73568c55460 |
14 | 3666db13d5b |
15 | 1b0a77659a1 |
hex | e92366a85d |
1001321310301 has 8 divisors (see below), whose sum is σ = 1078356020000. Its totient is φ = 924288028272.
The previous prime is 1001321310287. The next prime is 1001321310331. The reversal of 1001321310301 is 1030131231001.
1001321310301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1001321310301 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 (1001321310331) 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, 1431826 + ... + 2013148.
It is an arithmetic number, because the mean of its divisors is an integer number (134794502500).
Almost surely, 21001321310301 is an apocalyptic number.
It is an amenable number.
1001321310301 is a deficient number, since it is larger than the sum of its proper divisors (77034709699).
1001321310301 is a wasteful number, since it uses less digits than its factorization.
1001321310301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 713835.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 1001321310301 its reverse (1030131231001), we get a palindrome (2031452541302).
The spelling of 1001321310301 in words is "one trillion, one billion, three hundred twenty-one million, three hundred ten thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •