Base | Representation |
---|---|
bin | 10000001100100101001… |
… | …110010000001100111001 |
3 | 10221101220100102021101002 |
4 | 100030211032100030321 |
5 | 121213431340214113 |
6 | 2211151555134345 |
7 | 143261461411553 |
oct | 20144516201471 |
9 | 3841810367332 |
10 | 1113021023033 |
11 | 39a036395357 |
12 | 15b8645a43b5 |
13 | 80c5a62ac2a |
14 | 3bc289464d3 |
15 | 1de43ba6c58 |
hex | 10325390339 |
1113021023033 has 16 divisors (see below), whose sum is σ = 1173491070480. Its totient is φ = 1054036279296.
The previous prime is 1113021023021. The next prime is 1113021023041. The reversal of 1113021023033 is 3303201203111.
It can be written as a sum of positive squares in 8 ways, for example, as 174964850944 + 938056172089 = 418288^2 + 968533^2 .
It is a cyclic number.
It is not a de Polignac number, because 1113021023033 - 236 = 1044301546297 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1113021022996 and 1113021023014.
It is not an unprimeable number, because it can be changed into a prime (1113021029033) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4894841 + ... + 5117177.
It is an arithmetic number, because the mean of its divisors is an integer number (73343191905).
Almost surely, 21113021023033 is an apocalyptic number.
It is an amenable number.
1113021023033 is a deficient number, since it is larger than the sum of its proper divisors (60470047447).
1113021023033 is a wasteful number, since it uses less digits than its factorization.
1113021023033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 225676.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 1113021023033 its reverse (3303201203111), we get a palindrome (4416222226144).
The spelling of 1113021023033 in words is "one trillion, one hundred thirteen billion, twenty-one million, twenty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •