Base | Representation |
---|---|
bin | 11101011101110100101… |
… | …00101111110101001101 |
3 | 10120210021220201100102022 |
4 | 32232322110233311031 |
5 | 113041440442044113 |
6 | 2053035433535525 |
7 | 133101201121616 |
oct | 16567224576515 |
9 | 3523256640368 |
10 | 1012443315533 |
11 | 360413948041 |
12 | 1442752745a5 |
13 | 7461c229640 |
14 | 37006ca2c0d |
15 | 1b508da4908 |
hex | ebba52fd4d |
1012443315533 has 32 divisors (see below), whose sum is σ = 1181608694784. Its totient is φ = 858986330112.
The previous prime is 1012443315517. The next prime is 1012443315539. The reversal of 1012443315533 is 3355133442101.
It is not a de Polignac number, because 1012443315533 - 24 = 1012443315517 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1012443315493 and 1012443315502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012443315539) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4640216 + ... + 4853502.
It is an arithmetic number, because the mean of its divisors is an integer number (36925271712).
Almost surely, 21012443315533 is an apocalyptic number.
1012443315533 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1012443315533 is a deficient number, since it is larger than the sum of its proper divisors (169165379251).
1012443315533 is a wasteful number, since it uses less digits than its factorization.
1012443315533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213821.
The product of its (nonzero) digits is 64800, while the sum is 35.
Adding to 1012443315533 its reverse (3355133442101), we get a palindrome (4367576757634).
The spelling of 1012443315533 in words is "one trillion, twelve billion, four hundred forty-three million, three hundred fifteen thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •