Base | Representation |
---|---|
bin | 11101011011001010001… |
… | …01101011001100011111 |
3 | 10120122121020220002021221 |
4 | 32231211011223030133 |
5 | 113031023401113043 |
6 | 2052241511434211 |
7 | 133020565160245 |
oct | 16554505531437 |
9 | 3518536802257 |
10 | 1011013301023 |
11 | 35a84a718a70 |
12 | 143b36385967 |
13 | 74451b9c3cb |
14 | 36d0cdba795 |
15 | 1b4735818ed |
hex | eb6516b31f |
1011013301023 has 8 divisors (see below), whose sum is σ = 1103005322496. Its totient is φ = 919034899800.
The previous prime is 1011013300981. The next prime is 1011013301027. The reversal of 1011013301023 is 3201033101101.
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 1011013301023 - 29 = 1011013300511 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1011013300988 and 1011013301006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011013301027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3249543 + ... + 3547048.
It is an arithmetic number, because the mean of its divisors is an integer number (137875665312).
Almost surely, 21011013301023 is an apocalyptic number.
1011013301023 is a deficient number, since it is larger than the sum of its proper divisors (91992021473).
1011013301023 is a wasteful number, since it uses less digits than its factorization.
1011013301023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6810125.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 1011013301023 its reverse (3201033101101), we get a palindrome (4212046402124).
The spelling of 1011013301023 in words is "one trillion, eleven billion, thirteen million, three hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •