Base | Representation |
---|---|
bin | 10000010101111010011… |
… | …010000111001111110001 |
3 | 10222100202121010122101010 |
4 | 100111322122013033301 |
5 | 121344441233130113 |
6 | 2215530103301133 |
7 | 144064660413213 |
oct | 20257232071761 |
9 | 3870677118333 |
10 | 1123040130033 |
11 | 3a330796a778 |
12 | 16179ba4a7a9 |
13 | 81b96278203 |
14 | 3c4d94405b3 |
15 | 1e32d58b1c3 |
hex | 1057a6873f1 |
1123040130033 has 8 divisors (see below), whose sum is σ = 1497565623328. Its totient is φ = 748604028384.
The previous prime is 1123040130019. The next prime is 1123040130059. The reversal of 1123040130033 is 3300310403211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1123040130033 - 26 = 1123040129969 is a prime.
It is a super-2 number, since 2×11230401300332 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1123040129991 and 1123040130009.
It is not an unprimeable number, because it can be changed into a prime (1123040131033) 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, 22318591 + ... + 22368852.
It is an arithmetic number, because the mean of its divisors is an integer number (187195702916).
Almost surely, 21123040130033 is an apocalyptic number.
It is an amenable number.
1123040130033 is a deficient number, since it is larger than the sum of its proper divisors (374525493295).
1123040130033 is an equidigital number, since it uses as much as digits as its factorization.
1123040130033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44695823.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 1123040130033 its reverse (3300310403211), we get a palindrome (4423350533244).
The spelling of 1123040130033 in words is "one trillion, one hundred twenty-three billion, forty million, one hundred thirty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •