Base | Representation |
---|---|
bin | 110001011000000010… |
… | …1100011101100000000 |
3 | 101010200122122222011212 |
4 | 1202300011203230000 |
5 | 3214124031241031 |
6 | 120413333025252 |
7 | 10442415361526 |
oct | 1426005435400 |
9 | 333618588155 |
10 | 106033462016 |
11 | 40a72141449 |
12 | 18672485228 |
13 | 9cca7c3201 |
14 | 51bc4a0316 |
15 | 2b58c8212b |
hex | 18b0163b00 |
106033462016 has 36 divisors (see below), whose sum is σ = 212655932664. Its totient is φ = 52765440000.
The previous prime is 106033462009. The next prime is 106033462019. The reversal of 106033462016 is 610264330601.
It is a super-2 number, since 2×1060334620162 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is not an unprimeable number, because it can be changed into a prime (106033462019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 927485 + ... + 1035516.
Almost surely, 2106033462016 is an apocalyptic number.
106033462016 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
106033462016 is an abundant number, since it is smaller than the sum of its proper divisors (106622470648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106033462016 is an equidigital number, since it uses as much as digits as its factorization.
106033462016 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1963228 (or 1963214 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 32.
Adding to 106033462016 its reverse (610264330601), we get a palindrome (716297792617).
The spelling of 106033462016 in words is "one hundred six billion, thirty-three million, four hundred sixty-two thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •