Base | Representation |
---|---|
bin | 10000010101111000110… |
… | …111101000000111110001 |
3 | 10222100200210112222021201 |
4 | 100111320313220013301 |
5 | 121344413130444213 |
6 | 2215523342051201 |
7 | 144064225104226 |
oct | 20257067500761 |
9 | 3870623488251 |
10 | 1123014312433 |
11 | 3a32a4336612 |
12 | 161793279b01 |
13 | 81b90b08b20 |
14 | 3c4d5c3d94d |
15 | 1e32b18b6dd |
hex | 10578de81f1 |
1123014312433 has 16 divisors (see below), whose sum is σ = 1248603338752. Its totient is φ = 1003035960000.
The previous prime is 1123014312419. The next prime is 1123014312439. The reversal of 1123014312433 is 3342134103211.
It is a cyclic number.
It is not a de Polignac number, because 1123014312433 - 217 = 1123014181361 is a prime.
It is a super-2 number, since 2×11230143124332 (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 (1123014312439) 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, 2475208 + ... + 2893558.
It is an arithmetic number, because the mean of its divisors is an integer number (78037708672).
Almost surely, 21123014312433 is an apocalyptic number.
1123014312433 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1123014312433 is a deficient number, since it is larger than the sum of its proper divisors (125589026319).
1123014312433 is a wasteful number, since it uses less digits than its factorization.
1123014312433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 425056.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 1123014312433 its reverse (3342134103211), we get a palindrome (4465148415644).
The spelling of 1123014312433 in words is "one trillion, one hundred twenty-three billion, fourteen million, three hundred twelve thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •