Base | Representation |
---|---|
bin | 11101110001101110111… |
… | …10110010001000110011 |
3 | 10121210212220022021001110 |
4 | 32320313132302020303 |
5 | 113230334024024021 |
6 | 2102004255404403 |
7 | 133630122200655 |
oct | 16706736621063 |
9 | 3553786267043 |
10 | 1023133033011 |
11 | 3649a9a18aa1 |
12 | 146359223703 |
13 | 75633a95b5b |
14 | 3773c8846d5 |
15 | 1b9325a3476 |
hex | ee377b2233 |
1023133033011 has 8 divisors (see below), whose sum is σ = 1366204389520. Its totient is φ = 681075182592.
The previous prime is 1023133032989. The next prime is 1023133033051. The reversal of 1023133033011 is 1103303313201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1023133033011 - 29 = 1023133032499 is a prime.
It is a super-2 number, since 2×10231330330112 (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 (1023133033051) 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, 253374166 + ... + 253378203.
It is an arithmetic number, because the mean of its divisors is an integer number (170775548690).
Almost surely, 21023133033011 is an apocalyptic number.
1023133033011 is a deficient number, since it is larger than the sum of its proper divisors (343071356509).
1023133033011 is an equidigital number, since it uses as much as digits as its factorization.
1023133033011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 506753045.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 1023133033011 its reverse (1103303313201), we get a palindrome (2126436346212).
The spelling of 1023133033011 in words is "one trillion, twenty-three billion, one hundred thirty-three million, thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •