Base | Representation |
---|---|
bin | 10100111101110001110011… |
… | …11100011111111011110110 |
3 | 20001020102021212111012000020 |
4 | 22132320321330133323312 |
5 | 22020323223141203042 |
6 | 242015254545430010 |
7 | 12465562030424460 |
oct | 1236707174377366 |
9 | 201212255435006 |
10 | 46103151116022 |
11 | 13765266997740 |
12 | 520712403b306 |
13 | 1c9567c21b390 |
14 | b55593a2b130 |
15 | 54e3ae8833ec |
hex | 29ee39f1fef6 |
46103151116022 has 128 divisors (see below), whose sum is σ = 126137346370560. Its totient is φ = 10845142064640.
The previous prime is 46103151115963. The next prime is 46103151116039. The reversal of 46103151116022 is 22061115130164.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 72098497 + ... + 72735132.
It is an arithmetic number, because the mean of its divisors is an integer number (985448018520).
Almost surely, 246103151116022 is an apocalyptic number.
46103151116022 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
46103151116022 is an abundant number, since it is smaller than the sum of its proper divisors (80034195254538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46103151116022 is a wasteful number, since it uses less digits than its factorization.
46103151116022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144833718.
The product of its (nonzero) digits is 8640, while the sum is 33.
Adding to 46103151116022 its reverse (22061115130164), we get a palindrome (68164266246186).
The spelling of 46103151116022 in words is "forty-six trillion, one hundred three billion, one hundred fifty-one million, one hundred sixteen thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.515 sec. • engine limits •