Base | Representation |
---|---|
bin | 11101110001101110111… |
… | …11110110011111110011 |
3 | 10121210212220211111010211 |
4 | 32320313133312133303 |
5 | 113230334112004021 |
6 | 2102004305404551 |
7 | 133630124445205 |
oct | 16706737663763 |
9 | 3553786744124 |
10 | 1023133313011 |
11 | 3649aa09a3a7 |
12 | 146359339757 |
13 | 75633b63434 |
14 | 3773c918775 |
15 | 1b93260b3e1 |
hex | ee377f67f3 |
1023133313011 has 12 divisors (see below), whose sum is σ = 1075790809632. Its totient is φ = 972330273936.
The previous prime is 1023133312963. The next prime is 1023133313023. The reversal of 1023133313011 is 1103133313201.
It is not a de Polignac number, because 1023133313011 - 213 = 1023133304819 is a prime.
It is a super-2 number, since 2×10231333130112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1023133313071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7409211 + ... + 7546036.
It is an arithmetic number, because the mean of its divisors is an integer number (89649234136).
Almost surely, 21023133313011 is an apocalyptic number.
1023133313011 is a deficient number, since it is larger than the sum of its proper divisors (52657496621).
1023133313011 is an equidigital number, since it uses as much as digits as its factorization.
1023133313011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14955370 (or 14955327 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 1023133313011 its reverse (1103133313201), we get a palindrome (2126266626212).
The spelling of 1023133313011 in words is "one trillion, twenty-three billion, one hundred thirty-three million, three hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •