Base | Representation |
---|---|
bin | 11101101100001000001… |
… | …00110110111100100101 |
3 | 10121112010010121121011202 |
4 | 32312010010312330211 |
5 | 113203203004142201 |
6 | 2100345454412245 |
7 | 133462413260453 |
oct | 16660404667445 |
9 | 3545103547152 |
10 | 1020123115301 |
11 | 3636a49a42a4 |
12 | 145859201085 |
13 | 7527431b364 |
14 | 37534c199d3 |
15 | 1b808200c6b |
hex | ed84136f25 |
1020123115301 has 8 divisors (see below), whose sum is σ = 1074080539680. Its totient is φ = 966192364368.
The previous prime is 1020123115261. The next prime is 1020123115303. The reversal of 1020123115301 is 1035113210201.
1020123115301 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-1020123115301 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020123115303) 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, 6589826 + ... + 6742851.
It is an arithmetic number, because the mean of its divisors is an integer number (134260067460).
Almost surely, 21020123115301 is an apocalyptic number.
It is an amenable number.
1020123115301 is a deficient number, since it is larger than the sum of its proper divisors (53957424379).
1020123115301 is a wasteful number, since it uses less digits than its factorization.
1020123115301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13336723.
The product of its (nonzero) digits is 180, while the sum is 20.
Adding to 1020123115301 its reverse (1035113210201), we get a palindrome (2055236325502).
The spelling of 1020123115301 in words is "one trillion, twenty billion, one hundred twenty-three million, one hundred fifteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •