Base | Representation |
---|---|
bin | 1110111101000110111100… |
… | …1011001000111001101011 |
3 | 2011012221020221102111200222 |
4 | 3233101233023020321223 |
5 | 4123400231000000412 |
6 | 54545450535320255 |
7 | 3314652603623342 |
oct | 357215713107153 |
9 | 64187227374628 |
10 | 16443000000107 |
11 | 526a48991733a |
12 | 1a1691b52008b |
13 | 9237505904a5 |
14 | 40bbb9c94b59 |
15 | 1d7ac0850072 |
hex | ef46f2c8e6b |
16443000000107 has 8 divisors (see below), whose sum is σ = 16616279246112. Its totient is φ = 16270492600000.
The previous prime is 16443000000073. The next prime is 16443000000121. The reversal of 16443000000107 is 70100000034461.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 16443000000107 - 26 = 16443000000043 is a prime.
It is a super-3 number, since 3×164430000001073 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (16443000000127) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 192918644 + ... + 193003857.
It is an arithmetic number, because the mean of its divisors is an integer number (2077034905764).
Almost surely, 216443000000107 is an apocalyptic number.
16443000000107 is a deficient number, since it is larger than the sum of its proper divisors (173279246005).
16443000000107 is a wasteful number, since it uses less digits than its factorization.
16443000000107 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 385922949.
The product of its (nonzero) digits is 2016, while the sum is 26.
Adding to 16443000000107 its reverse (70100000034461), we get a palindrome (86543000034568).
The spelling of 16443000000107 in words is "sixteen trillion, four hundred forty-three billion, one hundred seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •