Base | Representation |
---|---|
bin | 11101100100110110000… |
… | …10110111000101100000 |
3 | 10121011000122222120120112 |
4 | 32302123002313011200 |
5 | 113122201124002011 |
6 | 2054501514030452 |
7 | 133263501142043 |
oct | 16623302670540 |
9 | 3534018876515 |
10 | 1016213500256 |
11 | 361a79034689 |
12 | 144b47a18428 |
13 | 74aa0354b86 |
14 | 372838b2c5a |
15 | 1b679d8158b |
hex | ec9b0b7160 |
1016213500256 has 24 divisors (see below), whose sum is σ = 2002805574840. Its totient is φ = 507564465408.
The previous prime is 1016213500219. The next prime is 1016213500259. The reversal of 1016213500256 is 6520053126101.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1016213500259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16915946 + ... + 16975913.
It is an arithmetic number, because the mean of its divisors is an integer number (83450232285).
Almost surely, 21016213500256 is an apocalyptic number.
1016213500256 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1016213500256 is a deficient number, since it is larger than the sum of its proper divisors (986592074584).
1016213500256 is an equidigital number, since it uses as much as digits as its factorization.
1016213500256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33892806 (or 33892798 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 32.
Adding to 1016213500256 its reverse (6520053126101), we get a palindrome (7536266626357).
The spelling of 1016213500256 in words is "one trillion, sixteen billion, two hundred thirteen million, five hundred thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •